/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 2e6 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;



inline int ksm(int a,int b){
    int res=1;
    while(b){
        if(b&1)res=res*a%MOD;
        b>>=1;
        a=a*a%MOD;
    }
    return res;
}


int fac[N],inv[N];

void init(){
    fac[0]=1;
    for(int i=1;i<N;i++){
        fac[i]=fac[i-1]*i%MOD;
    }
    inv[N-1]=ksm(fac[N-1],MOD-2);
    for(int i=N-1;i;i--){
        inv[i-1]=inv[i]*i%MOD;
    }

}


inline int C(int n,int m){
    if(m>n)return 0;
    return fac[n]*inv[n-m]%MOD*inv[m]%MOD;
}

// inline int Catalan(int n){
//     return fac[2*n]*inv[n+1]%MOD*inv[n]%MOD;
// }

int solve(int a,int b){
    if(a<0||b<0)return 0;
    int res=((C(a+b,b)-C(a+b,b-1))%MOD+MOD)%MOD;
    return res;
}

void solve(){  
    int n=rd,m=rd,K=rd;
    cout<<solve(n-m+K,n-m)*solve(m-1,m-K)%MOD<<endl;
}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);

    init();

    cdbg("OK");
    int T=rd;
    while(T--){
        solve();
    }


}