//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=1e9+7;
const ll inv2=(mod+1)/2;
ll fact[1001000],rfact[1001000];
ll C(int n,int k)
{
	if(n==k) return 1;
	if(k<0||k>n) return 0;
	return fact[n]*rfact[k]%mod*rfact[n-k]%mod;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	fact[0]=rfact[1]=rfact[0]=1;
	for(int i=1;i<1001000;i++)
		fact[i]=fact[i-1]*i%mod;
	for(int i=2;i<1001000;i++)
		rfact[i]=(mod-mod/i)*rfact[mod%i]%mod;
	for(int i=2;i<1001000;i++)
		rfact[i]=rfact[i-1]*rfact[i]%mod;
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		ll k;
		cin>>n>>k;
		if(k>n)
			cout<<"0\n";
		else if(k==n)
			cout<<fact[n-1]*inv2%mod<<'\n';
		else
		{
			int c=n-k;
			ll ans=0;
			ll val=1;
			for(int i=0;i<=c;i++,val=val*inv2%mod)
				if(c+i<=n)
					ans=(ans+C(c,i)*val%mod*C(n-c-1,i-1))%mod;
			ans=ans*fact[n]%mod*rfact[c]%mod;
			cout<<ans<<'\n';
		}
	}
	return 0;
}