// yukicoder/1966/main.cpp // author: @___Johniel // github: https://github.com/johniel/ #include #define each(i, c) for (auto& i : c) #define unless(cond) if (!(cond)) // #define endl "\n" using namespace std; template ostream& operator << (ostream& os, pair p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream& operator >> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator << (ostream& os, vector v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; } template istream& operator >> (istream& is, vector& v) { for (auto& i: v) is >> i; return is; } template ostream& operator << (ostream& os, set s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; } template ostream& operator << (ostream& os, map m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; } template istream& operator >> (istream& is, array& a) { for (auto& i: a) is >> i; return is; } template ostream& operator << (ostream& os, array& a) { os << "[]{"; for (auto& i: a) os << i << ","; os << "}"; return os; } template inline T setmax(T& a, T b) { return a = std::max(a, b); } template inline T setmin(T& a, T b) { return a = std::min(a, b); } using lli = long long int; using ull = unsigned long long; using point = complex; using str = string; template using vec = vector; constexpr array di({0, 1, -1, 0, 1, -1, 1, -1}); constexpr array dj({1, 0, 0, -1, 1, -1, -1, 1}); constexpr lli mod = 1e9 + 7; // constexpr lli mod = 998244353; namespace math { lli extgcd(lli a, lli b, lli& x, lli& y) { lli g = a; x = 1; y = 0; if (b != 0) { g = extgcd(b, a % b, y, x); y -= (a / b) * x; } return g; } lli mod_inverse(lli a, lli m) { lli x, y; extgcd(a, m, x, y); return (m + x % m) % m; } lli mod_pow(lli n, lli p) { if (p == 0) return 1; if (p == 1) return n % mod; lli m = mod_pow(n, p / 2); m *= m; m %= mod; if (p % 2) m = (m * n) % mod; return m; } }; int main(int argc, char *argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios_base::fixed); cout.precision(15); int _; cin >> _; lli n, m; while (cin >> n >> m) { const lli x = math::mod_pow(n, m); const lli y = x * (x + 1) % mod * math::mod_inverse(2, mod) % mod; const lli a = math::mod_pow(n, m / 2); const lli b = a * (a + 1) % mod * (2 * a + 1) % mod * math::mod_inverse(6, mod) % mod; cout << (y - b + mod) % mod << endl; } return 0; }