#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

ll pow_mod(ll x, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*x)%mod;
        x = x*x%mod;
        n >>=1;
    }
    return ret;
}

ll solve(){
    ll n, m;
    cin >> n >> m;

    ll ans1 = (pow_mod(n, m, MOD)*(pow_mod(n, m, MOD)+1))%MOD;
    ll inv2 = pow_mod(2, MOD-2, MOD);
    ans1 = (ans1*inv2)%MOD;

    ll ans2 = (pow_mod(n, m/2, MOD)*(pow_mod(n, m/2, MOD)+1))%MOD;
    ans2 = (ans2*(2*pow_mod(n, m/2, MOD)+1))%MOD;
    ll inv6 = pow_mod(6, MOD-2, MOD);
    ans2 = (ans2*inv6)%MOD;

    return (MOD + ans1 - ans2)%MOD;
}

int main(){
    ll t;
    cin >> t;

    vector<ll> ans(t);
    rep(i, t) ans[i] = solve();
    rep(i, t) cout << ans[i] << endl;
}