#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
using namespace std;
const int N=1e5+10,P=1e9+7;
int fac[N],ifac[N],f[N],n,m,T;
inline int ksm(int a,int b){
    int ans=1;
    for(;b;b>>=1,a=1ll*a*a%P) if(b&1) ans=1ll*ans*a%P;
    return ans;
}
inline int C(int n,int k){
    if(n<k||k<0) return 0;
    return 1ll*fac[n]*ifac[k]%P*ifac[n-k]%P;
}
void pre(int n){
    f[0]=fac[0]=ifac[0]=1;int tt=(P+1)>>1;
    rep(i,1,n) fac[i]=1ll*fac[i-1]*i%P;ifac[n]=ksm(fac[n],P-2);
    per(i,n,1) ifac[i-1]=1ll*ifac[i]*i%P;
    rep(i,1,n) f[i]=1ll*tt*f[i-1]%P;
}
int main(){
    pre(1e5);scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        if(n<m){puts("0");continue;}
        if(n==m){printf("%lld\n",1ll*fac[n-1]*ifac[2]%P);continue;}
        if(m==0){puts("1");continue;}
        int w=n-m,ans=0;
        rep(i,0,w){
            int p=1ll*f[w-i]%P*C(w,i)%P;
            int q=C(m-1,w-i-1);
            ans=(ans+1ll*p*q)%P;
        }
        printf("%lld\n",1ll*ans*ifac[w]%P*fac[n]%P);
    }
    return 0;
}