# include <stdio.h>
# include <algorithm>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int M = 1000010;
const int mod = 1e9+7;

/*
假设m个人已经围成了一圈，那么有m个位置需要插空椅子。
C(n-k*m-1, m-1)*n/m
*/ 

ll frac[M];

inline ll pwr(ll x, ll y) {
	ll ret = 1;
	while(y) {
		if(y&1) ret = 1ll * ret * x % mod;
		x = 1ll * x * x % mod;
		y >>= 1;
	}
	return ret;
}

inline ll C(ll n, ll k) {
	if(n<k || n<0) return 0;
	return 1ll * frac[n] * pwr(1ll * frac[k] * frac[n-k] % mod, mod-2) % mod;
}

int n, m, k;

int main() {
//	freopen("meeting.in", "r", stdin);
//	freopen("meeting.out", "w", stdout);
	
	frac[0] = 1;
	for (int i=1; i<=1000000; ++i)
		frac[i] = 1ll * frac[i-1] * i % mod;
		
	int Q; scanf("%d", &Q);
	while(Q--) {
		scanf("%d%d%d", &n, &m, &k);
		if(m == 1) {
			printf("%d\n", n);
			continue;
		}
		if(n-(k+1)*m < 0) {
			puts("0");
			continue;
		}
		ll ans = 1ll * C(n-m*k-1, m-1)*n % mod * pwr(m, mod-2) % mod;
		printf("%lld\n", ans);
	}
	return 0;
}