B. AND 0, Sum Big

B. 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 n and k, count the number of arrays of length n such that:

• all its elements are integers between 0 and 2^k−1 (inclusive);
• the bitwise AND of all its elements is 0;
• 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+7.

Input

The first line contains an integer t (1≤t≤10) — the number of test cases you need to solve.

Each test case consists of a line containing two integers n and k (1≤n≤10^5, 1≤k≤20).

Output

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+7.

Example

input

Copy

2
2 2
100000 20

output

Copy

4
226732710

Note

In the first example, the 4 arrays are:

• [3,0],
• [0,3],
• [1,2],
• [2,1].

题目大意：一个数组有n个元素，且都在0到2^k−1，这些元素的按位与等于0，且和尽量最大。

1.因为都在0到2^k−1，所以对于一个数，它的二进制只有k位
2.按位与等于0，所以二进制位上每一列至少有一个0
3.和尽量最大。所以每一列只有一个0

因此答案就是n^k %mod

c++代码：

#include<iostream>
#define AC 0
#define Please return
#define int long long
using namespace std;
const int mod=1e9+7;
int qpow(int a,int b){int ans=1;while(b){if(b&1)ans=ans*a;b>>=1;a=a*a;}return ans;}
int qpow(int a,int b,int m){int ans=1%m;while(b){if(b&1)ans=ans*a%m;b>>=1;a=a*a%m;}return ans;}

signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a,b;
        cin>>a>>b;
        cout<<qpow(a,b,mod)<<endl;
    }
    Please AC;
}