赤果果的错排…
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
#define rep2(i,k,n) for(int i=k;i>=(n);i--)
#define mod 1000000007
using namespace std;
typedef long long ll;
const int N=1000000;
int bin[N+5],pin[N+5],T,n,m,pin2[N+5];
inline int qpow(int a,int b){
int ans=1,aa=a;
for(;b;b>>=1){if(b&1)ans=(int)(1ll*ans*aa%mod);
aa=(int)(1ll*aa*aa%mod);
}return ans;
}
void init(){
bin[0]=1;rep(i,1,N)bin[i]=(int)(1ll*bin[i-1]*i%mod);
pin[0]=1;pin[N]=qpow(bin[N],mod-2);
rep2(i,N-1,1)pin[i]=(int)(1ll*pin[i+1]*(i+1)%mod);
rep(i,1,N){
pin2[i]=(pin2[i-1]+(i&1 ? -1 : 1)*pin[i])%mod;
while(pin2[i]<0)pin2[i]+=mod;
}
}
inline int C(int x,int y){if(x<y)return 0;
return (int)(1ll*bin[x]*pin[x-y]%mod*pin[y]%mod);
}
inline int solve(int x,int y){
int tmp=1ll*bin[x-y]*(1+pin2[x-y])%mod;
return (int)(1ll*C(x,y)*tmp%mod);
}
int main(){//freopen("permutation.in","r",stdin);
//freopen("permutation.out","w",stdout);
init();
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
printf("%d\n",solve(n,m));
}
return 0;
}