#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
template<class T> void chkmin(T &x,T y){if(y<x)x=y;}
typedef long long ll;
const int N=100005,MOD=1000000007;
int mo(int x){return x>=MOD?x-MOD:x;}
void moplus(int &x,int y){x=mo(x+y);}
int ksm(int a,int b)
{
    int res=1;
    while(b)
    {
        if(b&1)res=1ll*res*a%MOD;
        b>>=1;
        a=1ll*a*a%MOD;
    }
    return res;
}
int fac[N],ifac[N],pow2[N];
void math_init(int n)
{
    fac[0]=1;
    For(i,1,n)fac[i]=1ll*fac[i-1]*i%MOD;
    ifac[n]=ksm(fac[n],MOD-2);
    Rof(i,n,1)ifac[i-1]=1ll*ifac[i]*i%MOD;
    pow2[0]=1;
    For(i,1,n)pow2[i]=mo(pow2[i-1]<<1);
}
int getC(int a,int b){return 1ll*fac[a]*ifac[b]%MOD*ifac[a-b]%MOD;}
void Main()
{
    int n; ll m;
    scanf("%d%lld",&n,&m);
    if(m>n){printf("0\n"); return;}
    if(m==n){printf("%d\n",fac[n-1]); return;}
    int ans=0,f=1;
    m=n-m;
    For(i,0,min(m,n-m))
    {
        ans=(ans+1ll*f*pow2[m-i]%MOD*getC(m,i)%MOD*getC(n-i-1,n-m-i))%MOD;
        f=MOD-f;
    }
    ans=1ll*ans*fac[n]%MOD*ifac[m]%MOD*ksm(pow2[m],MOD-2)%MOD;
    printf("%d\n",ans);
}
int main()
{
    math_init(100000);
    int t;
    scanf("%d",&t);
    while(t--)Main();
}