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

Baby Badawy 说的第一句话是 “AND 0 SUM BIG”，因此他决定解决如下问题：给定两个整数 $n$ 和 $k$，计算满足以下条件的长度为 $n$ 的数组的个数：

• 数组中所有元素均为介于 $0$ 与 $2^k-1$（含端点）之间的整数；
• 所有元素的按位与结果为 $0$；
• 所有元素的和尽可能大。

由于答案可能非常大，请输出其对 $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$).

第一行包含一个整数 $t$（$1 \le t \le 10$）—— 表示你需要求解的测试用例数量。

每个测试用例由一行组成，包含两个整数 $n$ 和 $k$（$1 \le n \le 10^{5}$，$1 \le k \le 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+7$.

对于每个测试用例，输出满足条件的数组个数。由于答案可能非常大，请输出其对 $10^9+7$ 取模的结果。

In the first example, the $4$ arrays are:

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

在第一个例子中，这 $4$ 个数组是：

• $[3,0]$，
• $[0,3]$，
• $[1,2]$，
• $[2,1]$。