#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef long long ll;
const int MAXN=1000005;
const int MOD=1e9+7;

ll n,m;
ll fac[MAXN],inv[MAXN],D[MAXN];

void Init(){
    fac[0]=1;
    for(int i=1;i<MAXN;i++) fac[i]=fac[i-1]*i%MOD;
    inv[1]=1;
    for(int i=2;i<MAXN;i++) inv[i]=1ll*(MOD-MOD/i)*inv[MOD%i]%MOD;
    inv[0]=1;
    for(int i=1;i<MAXN;i++) (inv[i]*=inv[i-1])%=MOD;
    D[0]=D[2]=1;
    for(int i=3;i<MAXN;i++) D[i]=1ll*(i-1)*((D[i-1]+D[i-2])%MOD)%MOD;
}

ll C(ll x,ll y){
    if(x<y) return 0;
    return 1ll*fac[x]*((inv[y]*inv[x-y])%MOD)%MOD;
}

int main(){
    Init();
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%lld%lld",&n,&m);
        ll ans=C(n,m)*D[n-m]%MOD;
        printf("%lld\n",(ans+MOD)%MOD);
    }
}