#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long#define scl(i) scanf("%lld", &i)
#define scll(i, j) scanf("%lld %lld", &i, &j)
#define sclll(i, j, k) scanf("%lld %lld %lld", &i, &j, &k)
#define scllll(i, j, k, l) scanf("%lld %lld %lld %lld", &i, &j, &k, &l)#define scs(i) scanf("%s", i)
#define sci(i) scanf("%d", &i)
#define scd(i) scanf("%lf", &i)
#define scIl(i) scanf("%I64d", &i)
#define scii(i, j) scanf("%d %d", &i, &j)
#define scdd(i, j) scanf("%lf %lf", &i, &j)
#define scIll(i, j) scanf("%I64d %I64d", &i, &j)
#define sciii(i, j, k) scanf("%d %d %d", &i, &j, &k)
#define scddd(i, j, k) scanf("%lf %lf %lf", &i, &j, &k)
#define scIlll(i, j, k) scanf("%I64d %I64d %I64d", &i, &j, &k)
#define sciiii(i, j, k, l) scanf("%d %d %d %d", &i, &j, &k, &l)
#define scdddd(i, j, k, l) scanf("%lf %lf %lf %lf", &i, &j, &k, &l)
#define scIllll(i, j, k, l) scanf("%I64d %I64d %I64d %I64d", &i, &j, &k, &l)#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define lowbit(i) (i & (-i))
#define mem(i, j) memset(i, j, sizeof(i))#define fir first
#define sec second
#define VI vector<int>
#define ins(i) insert(i)
#define pb(i) push_back(i)
#define pii pair<int, int>
#define VL vector<long long>
#define mk(i, j) make_pair(i, j)
#define all(i) i.begin(), i.end()
#define pll pair<long long, long long>#define _TIME 0
#define _INPUT 0
#define _OUTPUT 0
clock_t START, END;
void __stTIME();
void __enTIME();
void __IOPUT();
using namespace std;const int maxn = 1e5 + 10;
const LL mod = 1e9 + 7;struct MAT{LL val[12][12];int sz;MAT(){};MAT(int _sz){ sz = _sz; memset(val, 0, sizeof(val)); }friend MAT operator * (const MAT & A, const MAT & B){MAT C(A.sz);for(int k = 1; k <= C.sz; k++)for(int i = 1; i <= C.sz; i++){if(A.val[i][k] == 0) continue;for(int j = 1; j <= C.sz; j++){C.val[i][j] = C.val[i][j] + A.val[i][k] * B.val[k][j] % mod;if(C.val[i][j] >= mod) C.val[i][j] -= mod;}}return C;}
};MAT pow_mod(MAT a, LL b)
{MAT ret(a.sz);for(int i=1; i<=ret.sz; i++) ret.val[i][i] = 1;while(b){if(b & 1) ret = ret * a;a = a * a;b >>= 1;}return ret;
}LL Cal(int n, int m, int k)
{MAT A(m+1);for(int i=1; i<=A.sz; i++) A.val[1][i] = 1LL * k * (k - 1);for(int i=2; i<=A.sz; i++) A.val[i][i-1] = k * 1LL;A = pow_mod(A, n);LL ret = 0;for(int i=1; i<=A.sz; i++)ret = (ret + A.val[i][1]) % mod;return ret;
}int main(void){__stTIME();__IOPUT();int nCase;sci(nCase);while(nCase--){int n, m, k;sciii(n, m, k);printf("%lld\n", (Cal(n, m, k) - Cal(n, m-1, k) + mod) % mod);}__enTIME();return 0;}void __stTIME()
{#if _TIMESTART = clock();#endif
}void __enTIME()
{#if _TIMEEND = clock();cerr<<"execute time = "<<(double)(END-START)/CLOCKS_PER_SEC<<endl;#endif
}void __IOPUT()
{#if _INPUTfreopen("in.txt", "r", stdin);#endif#if _OUTPUTfreopen("out.txt", "w", stdout);#endif
}