#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int MN=1e6+5;
ll n,m,k,fac[MN],inv[MN];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
ll ksm(ll a, ll b){ll res=1;while(b){if(b&1)res=(res*a)%mod;a=(a*a)%mod;b>>=1;}return res;}
void init(){fac[0]=1;for(int i=1; i<MN; i++) fac[i]=fac[i-1]*i%mod;inv[MN-1]=ksm(fac[MN-1],mod-2);for(int i=MN-2; i>=0; i--) inv[i]=inv[i+1]*(i+1)%mod;}
ll C(ll n, ll m){if(n<m)return 0;return fac[n]*inv[m]%mod*inv[n-m]%mod;}
ll cal(ll n, ll m){return (C(n+m,n)-C(n+m,m-1)%mod+mod)%mod;}
void solve(){
    n=read();m=read();k=read();
    if(m>n||k>m) write(0);
    else write(cal(m-1,m-k)*cal(n-m+k,n-m)%mod);
    putchar('\n');
}
int main(){
    init();
    ll T=read();while(T--)solve();
    return 0;
}