#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1000010,p=1000000007;
int J[N],R[N];
int inv(int x){
	if(x==1) return 1;
	return (p-p/x*inv(p%x)%p)%p;
}
int cp(int x){
	if(x==0) return 1;
	if(x==1) return 0;
	if(x==2) return 1;
	return (x*cp(x-1)%p)*cp(x-2)%p;
}
signed main(){
	int T;
	scanf("%lld",&T);
	J[0]=R[0]=1;
	for(int i=1;i<=N;i++){
		R[i]=R[i-1]*i%p;
	}
	J[N]=inv(R[N]);
	for(int i=N-1;i>=1;i--) J[i]=J[i+1]*(i+1)%p;
	for(int i=1;i<=T;i++){
		int n,m;
		scanf("%lld%lld",&n,&m);
		printf("%lld",((R[n]*J[m]%p)*J[n-m]%p)*(cp(n-m)%p)%p);
		printf("\n");
	}
	return 0;
}