6

#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int t,n,m,k;
int C[1003][1003],mi[2003];
int main(){
for(int i=0;i<=1000;i++)
for(int j=0;j<=i;j++)
C[i][j]=(j0 || ji?1:C[i-1][j]+C[i-1][j-1]),C[i][j]%=mod;
mi[0]=1;
for(int i=1;i<=2000;i++)
mi[i]=mi[i-1]2%mod;
scanf("%d",&t);
while(t--){
scanf("%d%d%d",&n,&m,&k);
if(m-2k<0 || m-2k>n-k)
printf("0\n");
else
printf("%lld\n",(1LLC[n][k]mi[m-2k]%mod)C[n-k][m-2k]%mod);
}
return 0;
}