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:
- 其所有元素都是 $$$0$$$ 和 $$$2^k-1$$$(含)之间的整数;
- 其所有元素的按位与为 $$$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$$$.
输入
The first line contains an integer $$$t$$$ ($$$1 \le t \le 10$$$) — the number of test cases you need to solve.
Each test case consists of a line containing two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 10^{5}$$$, $$$1 \le k \le 20$$$).
输出
对于每个测试用例,打印满足条件的数组数量。 Since the answer can be very large, print its remainder when divided by $$$10^9+7$$$.
示例
输入 #1
2 2 2 100000 20
输出 #1
4 226732710
注意
In the first example, the $$$4$$$ arrays are:
- $$$[3,0]$$$,
- $$$[0,3]$$$,
- $$$[1,2]$$$,
- $$$[2,1]$$$.