#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 2000010;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, m, k;
int fc[N], inv[N];

inline int ksm(int base, int k)
{
    int res = 1;
    while (k)
    {

        if (k & 1) res = res * base % mod;
        base = base * base % mod, k >>= 1;
    }
    return res;
}

inline int C(int m, int n) { return m < n ? 0 : fc[m] * inv[n] % mod * inv[m - n] % mod; }

void solve()
{
    read(n, m, k);
    if (k > m) return puts("0"), void();
    // int ans = C(m - 1, m - k) * C(2 * (m - k), m - k) % mod * ksm(m - k + 1, mod - 2) % mod;
    int ans = (C(m - 1 + m - k, m - k) - C(m - 1 + m - k, m - k - 1) + mod) % mod;

    // int res = (C(n - m - 1 + k, k) - C(n - m - 1 + k, k - 1) + mod) % mod;
    int res = (C(n - m + k + n - m, n - m) - C(n - m + k + n - m, n - m - 1) + mod) % mod;
    cout << ans * res % mod << '\n';
}

signed main()
{
    for (int i = fc[0] = 1; i < N; i ++) fc[i] = fc[i - 1] * i % mod;
    inv[N - 1] = ksm(fc[N - 1], mod - 2);
    for (int i = N - 2; i >= 0; i --) inv[i] = inv[i + 1] * (i + 1) % mod;

    int T; read(T);
    while (T --) solve();

    return 0;
}