#include<bits/stdc++.h>

#define ll long long

#define mod 1000000007

using namespace std;

int fac[];

int inv[];

int f[];

int T,n,m;

int power(int x,int y){

    int s=;

    while(y){

        if(y&)s=1ll*s*x%mod;

        y>>=,x=1ll*x*x%mod;

    }return s;

}

inline int read(){

    int s=;char ch=getchar();

    for(;ch<''||ch>'';ch=getchar());

    for(;ch>=''&&ch<='';ch=getchar())s=s*+ch-'';

    return s;

}

int main(){

    freopen("menci_permutation.in","r",stdin);

    freopen("menci_permutation.out","w",stdout);

    fac[]=;

    for(int i=;i<=;++i)fac[i]=1ll*fac[i-]*i%mod;

    inv[]=power(fac[],mod-);inv[]=;

    for(int i=-;i;--i)inv[i]=1ll*inv[i+]*(i+)%mod;

    f[]=;f[]=;f[]=;

    for(int i=;i<=;++i)f[i]=1ll*(i-)*(f[i-]+f[i-])%mod;

    T=read();

    while(T--){

        n=read();m=read();

        printf("%d\n",1ll*fac[n]*inv[m]%mod*inv[n-m]%mod*f[n-m]%mod);

    }return ;

}