#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a,i##i=b;i<=i##i;++i)
#define ROF(i,a,b) for(int i=a,i##i=b;i>=i##i;--i)
using namespace std;
typedef long long ll;
const int N=1e5+7,mod=1e9+7,i2=(mod+1)/2;
ll n,fac[N],ifac[N],m;
inline ll qpow(ll a,ll b){
    ll R=1;a%=mod;
    for(;b;b>>=1,a=a*a%mod)if(b&1)R=R*a%mod;
    return R;
}
inline ll C(int n,int m){
    return fac[n]*1ll*ifac[m]%mod*ifac[n-m]%mod;
}
void work(){
    scanf("%lld%lld",&n,&m);
    if(m>n){
        puts("0");
        return;
    }
    if(m==n){
        puts("1");
        return;
    }
    ll ans=0,s2=1;
    FOR(i,0,min(m,n-m)){
        ans+=(i&1?mod-1ll:1ll)*s2%mod*C(n-m,i)%mod*C(n-i-1,m-i)%mod;
        if(ans>=mod)ans-=mod;
        s2=s2*i2%mod;
    }
    ans%=mod;
    ans=ans*fac[n]%mod*ifac[n-m]%mod;
    printf("%lld\n",(ans+mod)%mod);
}
signed main(){
//    freopen("dt.in","r",stdin);
    int T;
    scanf("%d",&T);
    *fac=1;
    FOR(i,1,N-1)fac[i]=fac[i-1]*1ll*i%mod;
    ifac[N-1]=qpow(fac[N-1],mod-2);
    ROF(i,N-2,0)ifac[i]=(i+1ll)*ifac[i+1]%mod;
    while(T--)work();
    return 0;
}