1 /******************************
 2 code by drizzle
 3 blog: www.cnblogs.com/hsd-/
 4 ^ ^    ^ ^
 5  O      O
 6 ******************************/
 7 #include<bits/stdc++.h>
 8 #include<iostream>
 9 #include<cstring>
10 #include<cmath>
11 #include<cstdio>
12 #define ll long long
13 #define mod 1000000007
14 #define PI acos(-1.0)
15 #define N 1000000000
16 using namespace std;
17 ll quickmod(ll a,ll b)
18 {
19     ll sum=1;
20     while(b)
21     {
22         if(b&1)
23             sum=(sum*a)%mod;
24         b>>=1;
25         a=(a*a)%mod;
26     }
27     return sum;
28 }
29 ll combine1(ll n,ll m) //计算组合数C(n,m)
30 {
31     if(n<0||m<0)
32         return 0;
33     ll sum=1; //线性计算
34     for(ll i=1,j=n;i<=m;i++,j--)
35         sum=(((sum*j)%mod)*quickmod(i,mod-2))%mod;
36     return sum;
37 }
38 int t;
39 ll nn,mm,kk;
40 int main()
41 {
42     while(scanf("%d",&t)!=EOF)
43     {
44         for(int i=1;i<=t;i++)
45         {
46             scanf("%I64d %I64d %I64d",&nn,&mm,&kk);
47             if(mm==1)
48                 printf("%I64d\n",nn);
49             else
50                printf("%I64d\n",(((combine1(nn-mm*kk-1,mm-1)%mod)*quickmod(mm,mod-2))%mod*nn)%mod);
51         }
52     }
53     return 0;
54 }