#include<bits/stdc++.h>
using namespace std;
#define M 200005
#define P 1000000007
#define ll long long
int a[M],fc[M],inv[M],pw[M];
int C(int n,int m){
	return 1ll*fc[n]*inv[m]%P*inv[n-m]%P;
}
void solve(){
	int n,m;
	scanf("%d%d",&n,&m);
	if(m>n)puts("0");
	else{
		int ans=0;
		if(m==0)puts("1");
		else if(m==n){
			if(n<=2)puts("0");
			printf("%d\n",1ll*fc[n-1]*pw[1]%P);
		}
		else{
			for(int i=2;i<=2*m&&i<=n;i+=2){
				int d2=(2*m-i)/2,d0=n-i-d2,tp=1;
				if(d0>=0){
					tp=1ll*tp*C(n,i)%P*C(n-i,d2)%P;
					tp=1ll*tp*C(i,i/2)%P*fc[i/2]%P*pw[i/2]%P;
					tp=1ll*tp*fc[d2]%P*C(d2+i/2-1,i/2-1)%P;
					ans=(ans+tp)%P;
				}
			}
			printf("%d\n",ans);
		}
	}
}
int main(){
	fc[0]=fc[1]=inv[0]=inv[1]=1;
	for(int i=2;i<M;++i)fc[i]=1ll*i*fc[i-1]%P;
	for(int i=2;i<M;++i)inv[i]=(P-1ll*P/i)*inv[P%i]%P;
	pw[0]=1;pw[1]=inv[2];
	for(int i=2;i<M;++i)pw[i]=1ll*pw[1]*pw[i-1]%P;
	for(int i=2;i<M;++i)inv[i]=1ll*inv[i-1]*inv[i]%P;
	int t;
	scanf("%d",&t);
	while(t--)solve();
}