#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int N = 4e6 + 100;
const int mod = 1e9 + 7;
int Inv(int x){
    int a = x, b = mod - 2, r = 1;
    while(b){
        if(b & 1) r = r * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return r;
}
int fc[N], ifc[N];
int C(int n, int m){
    if(n < m) return 0;
    if(!m) return 1;
    return fc[n] * ifc[n - m] % mod * ifc[m] % mod;
}
int q;
int32_t main(){
    scanf("%lld",&q);
    const int maxn = 4e6;
    fc[0] = ifc[0] = 1;for(int i = 1;i <= maxn;i++) fc[i] = fc[i - 1] * i % mod;
    ifc[maxn] = Inv(fc[maxn]);
    for(int i = maxn - 1;i;i--) ifc[i] = ifc[i + 1] * (i + 1) % mod;
    for(int _t = 1;_t <= q;_t++){
        int n, m, k;
        scanf("%lld%lld%lld",&n,&m,&k);
        if(n < m || m < k){
            cout << 0 << endl;
            continue;
        }
        int bf = (C(2 * m - k - 1, m - k) - C(2 * m - k - 1, m - k - 1) + mod) % mod;
        int af = (C(2 * n - 2 * m + k, n - m) - C(2 * n - 2 * m + k, n - m + k + 1) + mod) % mod;
        printf("%lld\n",bf * af % mod);
    }
    return 0;
}