p_a_l_i_d

#include <iostream>
#define Kmax 10
#define MOD 1000000007
#define LL long long int
using namespace std;
int c[2][Kmax];

void pdcomb(int n) /// folosesc doar doua linii (0 si 1)
{
    for(int i=0;i<=Kmax;++i) /// Initializez matricea
        c[0][i]=c[1][i]=0;
    c[0][0]=c[1][0]=1; /// coloana 0
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=i;++j)
            c[1][j]=(c[0][j]+c[0][j-1]); /// Calculez linia urmatoare (1)
        for(int k=0;k<=i;++k) /// copiez linia 1 in linia 0
            c[0][k]=c[1][k];
    }
}

LL P(int a,int b) /// a^b logaritmic (recursiv)
{
    if(b==0)
        return 1ULL;
    else
        if(b%2==0)
            return P((1LL*a*a)%MOD,b/2);
        else
            return 1LL*a*P((1LL*a*a)%MOD,b/2)%MOD;
}

int main()
{
    int n,m,k;
    LL sol;
    cin>>n;
    while(n--)
    {
        cin>>m>>k;
        if(m%2)
            ++m;
        pdcomb(k);
        if(k==1)
            cout<<1<<'\n';
        else
        {
            sol=0;
            for(int i=0;k>2*i;++i)
                sol=(sol+c[1][i]*P(k-2*i,m))%MOD;
            sol*=P(P(2,k-1),MOD-2)%MOD;
            cout<<sol%MOD<<'\n';
        }
    }
    return 0;
}