#include<bits/stdc++.h>
#define i64 long long
using namespace std;
inline i64 rd()
{
	i64 num=0;char ch=getchar();bool op=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')op=1;
	for(;isdigit(ch);ch=getchar())num=num*10+(ch-'0');
	return op?-num:num;
}
const int mod=1000000007;
inline int Mod(int x){return x>=mod?x-mod:x;}
inline void Add(int&x,int v){x+=v;if(x>=mod)x-=mod;}
inline i64 qpow(i64 val,int p=mod-2)
{
	i64 res=1;
	while(p)
	{
		if(p&1)res=res*val%mod;
		val=val*val%mod;p>>=1;
	}
	return res;
}
const int N=1e5+10;
int fac[N],ifac[N];
int ipw[N];
inline void predone(int n=1e5+5)
{
	int ibase=qpow(2);
	ipw[0]=1;
	for(int i=1;i<=n;i++)ipw[i]=1ll*ipw[i-1]*ibase%mod;
	fac[0]=1;
	for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[n]=qpow(fac[n]);
	for(int i=n;i>=1;i--)ifac[i-1]=1ll*ifac[i]*i%mod;
}
inline int C(int n,int m){return n<m||m<0?0:1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}

inline void work()
{
	int n=rd();i64 m=rd();
	if(n< m){printf("0\n");return;}
	if(n==m){printf("%lld\n",1ll*fac[n-1]*qpow(2)%mod);return;}
	if(0==m){printf("1\n");return;}
	m=n-m;int Ans=0;
	for(int i=1;i<=m;i++)
		Add(Ans,1ll*C(n,m-i)*fac[n-(m-i)]%mod*C(n-(m-i)-i-1,i-1)%mod*ipw[i]%mod*ifac[i]%mod);
	printf("%d\n",Ans);
}
int main()
{
	predone();
	for(int test=rd();test;test--)work();
	return 0;
}