#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll modpow(ll x, ll n) {
  ll ans = 1;
  while(n > 0) {
    if(n % 2 == 1) {
      ans *= x;
      ans %= MOD;
    }
    x *= x;
    x %= MOD;
    n >>= 1;
  }
  return ans;
}
int main() {
  int t;
  cin >> t;
  while(t--) {
    ll n, m;
    cin >> n >> m;
    ll maxi = modpow(n, m);
    ll sum = maxi * (maxi + 1) % MOD * 500000004 % MOD;
    ll div = modpow(n, m / 2);
    cout << (sum -
             div % MOD * (div % MOD + 1) % MOD * (2 * div % MOD + 1) % MOD *
                 166666668 % MOD +
             MOD) %
                MOD
         << endl;
  }
  return 0;
}