#include <bits/stdc++.h>
const int mod = 1e9 + 7;
using namespace std;
long long jie[200005];
long long qpow(long long a, long long b) {
  long long sum = 1, t = a;
  while (b) {
    if (b & 1) sum *= t;
    sum %= mod;
    t = t * t;
    t %= mod;
    b >>= 1;
  }
  return sum;
}
long long C(long long n, long long m) {
  return jie[n] * qpow(jie[m], mod - 2) % mod * qpow(jie[n - m], mod - 2) % mod;
}
int T;
int main() {
  cin >> T;
  jie[0] = 1;
  for (int i = 1; i <= 200000; i++) {
    jie[i] = jie[i - 1] * i;
    jie[i] %= mod;
  }
  while (T--) {
    int n, k;
    cin >> n >> k;
    k;
    long long sum = 0, all = 0;
    long long ans = 0;
    for (int i = 0; i <= n; i += 2) sum += C(n, i), sum %= mod;
    for (int i = 0; i <= n; i++) all += C(n, i), all %= mod;
    if (k == 0) {
      cout << 1 << endl;
      continue;
    }
    if (n % 2) {
      cout << qpow(sum + 1, k) << endl;
    } else {
      for (int i = 1; i <= k + 1; i++) {
        ans += qpow(sum - 1, max(0, i - 1)) * qpow(all, max(k - i, 0));
        ans %= mod;
      }
      cout << ans << endl;
    }
  }
  return 0;
}
