#include<cstdio>
#include<cctype>
typedef long long int64;
inline int getint() {
    register char ch;
    while(!isdigit(ch=getchar()));
    register int x=ch^'0';
    while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
    return x;
}
const int N=1e6+1,mod=1e9+7;
int fac[N],ifac[N],d[N];
void exgcd(const int &a,const int &b,int &x,int &y) {
    if(!b) {
        x=1,y=0;
        return;
    }
    exgcd(b,a%b,y,x);
    y-=a/b*x;
}
inline int inv(const int &x) {
    int ret,tmp;
    exgcd(x,mod,ret,tmp);
    return (ret%mod+mod)%mod;
}
inline int C(const int &n,const int &m) {
    return (int64)fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
int main() {
    for(register int i=fac[0]=d[0]=1;i<N;i++) {
        fac[i]=(int64)fac[i-1]*i%mod;
    }
    ifac[N-1]=inv(fac[N-1]);
    for(register int i=N-1;i;i--) {
        ifac[i-1]=(int64)ifac[i]*i%mod;
    }
    for(register int i=2;i<N;i++) {
        d[i]=((d[i-1]+ifac[i]*(i&1?-1:1))%mod+mod)%mod;
    }
    for(register int i=2;i<N;i++) {
        d[i]=(int64)d[i]*fac[i]%mod;
    }
    for(register int T=getint();T;T--) {
        const int n=getint(),m=getint();
        const int ans=(int64)C(n,m)*d[n-m]%mod;
        printf("%d\n",ans);
    }
    return 0;
}