#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int iu=1e5;
ll f[100001],inf[100001];
ll ph[100001];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
ll C(int x,int y){
	if(y<0 || y>x) return 0;
	return f[x]*inf[y]%mod*inf[x-y]%mod;
}
ll inv(int d){
	return f[d-1]*inf[d]%mod;
}
ll n,m;
void solve(){
	cin >> n >> m;
	if(m>n){
		cout << "0\n";
		return;
	}
	if(m==n){
		cout << f[n-1]*ph[1]%mod << '\n';
		return;
	}
	if(m==0){
		cout << "1\n";
		return;
	}
	ll ans=0;
	for(int k=0; k<n-m ;k++){
		ll w1=C(n,k);
		ll w2=f[n-k-1];//arrange into cycle
		ll rep=inv(m)*(n-k)%mod*C(m,n-k-m)%mod;//arrange m*1 and (n-k-m)*0 in a circle so that no two 0 adjacent
		ll cur=w1*w2%mod*rep%mod*ph[n-k-m]%mod*inf[n-k-m-1]%mod;
		ans=(ans+cur)%mod;
		//cout << n << ' ' << k << ' ' << w1 << ' ' << w2 << ' ' << rep << ' ' << cur << endl;
	}
	cout << ans << '\n';
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	f[0]=1;
	for(int i=1; i<=iu ;i++) f[i]=f[i-1]*i%mod;
	inf[iu]=pw(f[iu],mod-2);
	for(int i=iu; i>=1 ;i--) inf[i-1]=inf[i]*i%mod;
	ph[0]=1;
	for(int i=1; i<=iu ;i++) ph[i]=ph[i-1]*(mod+1)/2%mod;
	int t;cin >> t;
	while(t--) solve();
}