#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxn = 510000;
const int mod  = 1e9+7;
const int inv2 = (mod+1)>>1;

int pw(int x,int k)
{
	int re=1;
	for(;k;k>>=1,x=(ll)x*x%mod) if(k&1)
		re=(ll)re*x%mod;
	return re;
}
int inv(int x){ return pw(x,mod-2); }

int fac[maxn],ifac[maxn],ipw2[maxn];
void pre()
{
	fac[0]=1; for(int i=1;i<maxn;i++) fac[i]=(ll)fac[i-1]*i%mod;
	ifac[maxn-1]=inv(fac[maxn-1]);
	for(int i=maxn-2;i>=0;i--) ifac[i]=(ll)ifac[i+1]*(i+1)%mod;
	ipw2[0]=1;
	for(int i=1;i<maxn;i++) ipw2[i]=(ll)ipw2[i-1]*inv2%mod;
}

int C(int i,int j)
{
	if(i<j || j<0 || i<0) return 0;
	return (ll)fac[i]*ifac[j]%mod*ifac[i-j]%mod;
}
int solve(int n,int m)
{
	if(m==0)
	{
		if(n==0) return 1;
		else return 0;
	}
	return (ll)C(n-1-1-2*(m-1)+1+m-2,m-1)*fac[n]%mod*ifac[m]%mod*ipw2[m]%mod;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	//freopen("tmp.in","r",stdin);
	
	pre();
	
	int Tcase; cin>>Tcase;
	while(Tcase--)
	{
		int n,m; cin>>n>>m;
		if(m>n-1) 
		{
			cout<<0<<'\n';
			continue;
		}
		int k= n-m;
		
		ll ans=0;
		for(int p=0;p<=k;p++)
		{
		//	ll tans=ans;
			ans+=(ll)C(n,p)*solve( n-p,k-p )%mod;
		//	cerr<<p<<" : "<<ans-tans<<endl;
		}
		cout<<ans%mod<<'\n';
	}
	
	return 0;
}