CF1514B AND 0, Sum Big

题目描述
Baby Badawy’s first words were “AND 0 SUM BIG”, so he decided to solve the following problem. Given two integers nn and kk , count the number of arrays of length nn such that:

all its elements are integers between 00 and 2^k-12
k
−1 (inclusive);
the bitwise AND of all its elements is 00 ;
the sum of its elements is as large as possible.
Since the answer can be very large, print its remainder when divided by 10^9+710
9
+7 .

输入格式
The first line contains an integer tt ( 1 \le t \le 101≤t≤10 ) — the number of test cases you need to solve.

Each test case consists of a line containing two integers nn and kk ( 1 \le n \le 10^{5}1≤n≤10
5
, 1 \le k \le 201≤k≤20 ).

输出格式
For each test case, print the number of arrays satisfying the conditions. Since the answer can be very large, print its remainder when divided by 10^9+710
9
+7 .

输入输出样例
输入 #1复制
2
2 2
100000 20
输出 #1复制
4
226732710
说明/提示
In the first example, the 44 arrays are:

[3,0][3,0] ,
[0,3][0,3] ,
[1,2][1,2] ,
[2,1][2,1] .
题目意思是一个数组，该数组有n个数字，每个数字转换为2进制有k位，问有多少个这样的数组st每个数组的每个数经过按位与以后为0并且加和最大，如果要按位与为0，则要保证每一位（k位中的）都要至少有一个0，如果要保证最大，则在这n个数字中只需要在该位有一个0就好了，直接结合上图来看，就很清晰地看出是n的k次方了。
我们要有创新形式，转换为图形直观的能力。
代码不贴了，答案就是那样。
/