using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new long[t];
        var mod = 1_000_000_007;
        var r2 = Exp(2, mod - 2, mod);
        var r6 = Exp(6, mod - 2, mod);
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            var (n, m) = (c[0], c[1]);
            var nm = Exp(n, m, mod);
            var nm2 = Exp(n, m / 2, mod);
            ans[u] = (nm * (nm + 1) % mod * r2 % mod + mod - nm2 * (nm2 + 1) % mod * (2 * nm2 + 1) % mod * r6 % mod) % mod;
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Exp(long n, long k, int mod)
    {
        if (k == 0) return 1;
        if (k == 1) return n % mod;
        var half = Exp(n, k / 2, mod);
        var result = (half * half) % mod;
        return ((k % 2) == 0) ? result : ((result * n) % mod);
    }
}