#include <bits/stdc++.h>
using namespace std;
#define matrix vector<vector<int> >
const int M = 1e9 + 7;
matrix operator *(const matrix &a, const matrix &b) {
	matrix c;
	c.resize(a.size());
	for (int i = 0; i < (int)a.size(); ++i) {
		c[i].resize(b[0].size(), 0);
		for (int j = 0; j < (int)b[0].size(); ++j) {
			for (int z = 0; z < (int)a[0].size(); ++z) {
				c[i][j] = (c[i][j] + 1LL * a[i][z] * b[z][j]) % M;
			}
		}
	}
	return c;
}
matrix unit(int n) {
	matrix ans(n, vector<int>(n, 0));
	for (int i = 0; i < n; ++i) {
		ans[i][i] = 1;
	}
	return ans;
}
matrix fpow(matrix a, long long b, int M = ::M) {
	matrix ans = unit(a.size());
	while (b) {
		if (b & 1) ans = ans * a;
		b >>= 1;
		a = a * a;
	}
	return ans;
}
int fpow(int a, long long b, int M = ::M) {
	int ans = 1;
	while (b) {
		if (b & 1) ans = 1LL * ans * a % M;
		a = 1LL * a * a % M;
		b >>= 1;
	}
	return ans;
}
void solve() {
	int n, k, l;
	cin >> n >> k >> l;
	matrix f = {{1LL * l * (l - 1) % M, 0LL, 1LL * l * (l - 1) % M * (l - 2) % M, 1LL * l * (l - 1) % M}};
	matrix m = {
		{0, 0, 0, 0},
		{0, 0, 0, 0},
		{1, 0, l - 2, 1},
		{0, 1, l - 1, 0}
	};
	int ans = (f * fpow(m, k - 3 + 1))[0][0];
	int tmp = fpow((1LL * (l - 1) * (l - 1) - l + 2) % M, 1LL * (n - 1) * k);
	ans = 1LL * ans * tmp % M;
	cout << ans << '\n';
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef LOCAL
	    // freopen("TEST.inp", "r", stdin);
	    // freopen("TEST.out", "w", stdout);
    #else
    	// freopen("TEST.inp", "r", stdin);
    	// freopen("TEST.out", "w", stdout);
    #endif
	int L;
	cin >> L;
	while (L--) {
		solve();
	}
    return 0;
}