#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define uint unsigned int
#define pii pair<int,int>
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
const int mod=1e9+7;
int t,n,ans,fac[100005],inv[100005],pw[100005];
ll m;
int Pow(int x,ll y,int p){
    int res=1;
    for(;y;y>>=1,x=1ll*x*x%p)   
        if(y&1)
            res=1ll*res*x%p;
    return res;
}
int C(int n,int m){
    if(n<m||m<0) return 0;
    return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main(){
    io;
    fac[0]=inv[0]=pw[0]=1;
    for(int i=1;i<=100000;i++) fac[i]=1ll*fac[i-1]*i%mod,pw[i]=2*pw[i-1]%mod;
    inv[100000]=Pow(fac[100000],mod-2,mod);
    for(int i=99999;i;i--) inv[i]=1ll*inv[i+1]*(i+1)%mod;
    cin>>t;
    while(t--){
        cin>>n>>m;
        if(m>n) cout<<"0\n";
        else if(!m) cout<<"1\n";
        else if(n==m) cout<<1ll*fac[n-1]*inv[pw[1]]%mod<<'\n';
        else{
            m=n-m,ans=0;
            for(int i=0;i<=m;i++)
                ans=(ans+1ll*fac[n]*inv[i]%mod*inv[m-i]%mod*pw[i]%mod*C(n-m-1,m-i-1))%mod;
            ans=1ll*ans*Pow(pw[m],mod-2,mod)%mod;
            cout<<ans<<'\n';
        }
    }
    return 0;
}