#include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define m0(x) memset(x,0,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define bg begin() #define ed end() #define all(x) x.bg,x.ed //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 1e9 + 7; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long int powmod(int n, int m) { int res = 1; while(m > 0) { if(m&1) res = (res*n)%mod; n = (n*n)%mod; m >>= 1; } return res; } ll inv(ll x) { ll res = 1; ll k = mod - 2; ll y = x; while (k) { if (k & 1) res = (res * y) % mod; y = (y * y) % mod; k /= 2; } return res; } int cal(int n) { return n*(n+1)%mod*(2*n+1)%mod*inv(6)%mod; } void solve() { //平方数 ダメ //それ以外OK // k^2<=n^m // k<=n^M int t; cin >> t; while(t--) { int n, m; cin >> n >> m; int M = m/2; int y = powmod(n, m); int x = powmod(n, M); cout << ((y*(y+1)%mod*inv(2) - cal(x)) % mod + mod) % mod << endl; } } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }