#include <cstdio>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2000000;
long long t, n, m, k;
long long inv[2000010], invfac[2000010], fac[2000010];
long long C(long long n, long long m) {
    if (n < m) return 0;
    return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
long long Catalan(long long n, long long m, long long k) {
    if (n < 0 || m < 0) return 0;
    if (m < k) {
        return C(n + m, m);
    } else if (k <= m && m <= n + k - 1) {
        return (C(n + m, m) - C(n + m, m - k) + mod) % mod;
    } else {
        return 0;
    }
}
long long solve(long long n, long long m, long long k) {
    return Catalan(m - 1, m - k, 1) * Catalan(n - m, n - m + k, k + 1) % mod;
}
int main() {
    inv[1] = invfac[0] = invfac[1] = fac[0] = fac[1] = 1;
    for (int i = 2; i <= maxn; i++) {
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
        invfac[i] = invfac[i - 1] * inv[i] % mod;
        fac[i] = fac[i - 1] * i % mod;
    }
    scanf("%lld", &t);
    while (t--) {
        scanf("%lld%lld%lld", &n, &m, &k);
        printf("%lld\n", solve(n, m, k));
    }
    return 0;
}