#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

ll power(ll x, ll y){
    x%=MOD;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ret;
}

ll divid(ll x, ll y){
    x%=MOD;
    return x*power(y,MOD-2)%MOD;
}

ll spn(ll n){
    n%=MOD;
    return divid(n*(n+1)%MOD*(n*2+1)%MOD,6);
}

void solve(){
    ll n, m; cin >> n >> m;
    ll nm=power(n,m);
    cout << (divid(nm*(nm+1),2)-spn(power(n,m/2))+MOD)%MOD << endl;
}

int main(){
    int t; cin >> t;
    while(t--) solve();
    return 0;
}