#include<bits/stdc++.h>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define ll long long
using namespace std;

const int mod=1e9+7;

int add(int x,int y){
    x+=y;
    return x>=mod?x-mod:x;
}
void adto(int&x,int y){
    x+=y;
    x>=mod?x-=mod:0;
}
int mul(int x,int y){
    return 1ll*x*y%mod;
}
int qpow(int a,int b){
    int ans=1;
    while(b){
        if(b&1)ans=mul(ans,a);
        a=mul(a,a);
        b>>=1;
    }
    return ans;
}

const int maxn=1e7+10;

int n,c;
int A[maxn];
int jc[maxn],ijc[maxn];
int i2p[maxn];
void solve(){
    n=c=1e7;
    cin>>n>>c;
    
    int t=mod-mul(4,c-1),em=t;
    A[0]=1;
    A[1]=mul(t,(mod+1)/2);
    int u=1;
    for(int k=2;k<=n;k++){
        em=mul(em,t);
        u=mul(u,2*k-3);
        int tmp=mul(em,mul(ijc[k],i2p[k]));
        tmp=mul(tmp,u);
        if(k-1&1)tmp=mod-tmp;
        A[k]=tmp;
    }
    for(int i=0;i<=n;i++){
        A[i]=mul(A[i],mod-c);
    }
    adto(A[0],(c-2+mod)%mod);
    for(int i=0;i<=n;i++){
        A[i]=mul(A[i],mod-(mod+1)/2);
    }
    int ans=0;
    t=1;
    for(int i=0;i<=n;i++){
        adto(ans,mul(A[n-i],t));
        t=mul(t,mul(c,c));
    }
    cout<<ans<<"\n";

    
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    for(int i=jc[0]=i2p[0]=1;i<maxn;i++){
        jc[i]=mul(jc[i-1],i);
        i2p[i]=mul(i2p[i-1],(mod+1)/2);
    }
    ijc[maxn-1]=qpow(jc[maxn-1],mod-2);
    for(int i=maxn-2;~i;i--){
        ijc[i]=mul(ijc[i+1],i+1);
    }

    int t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}