#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz = 1e5 + 5, mod = 1e9 + 7;
long long binpow(long long a, long long b) {
    a %= mod;
    if(a==0)
        return 0;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

int koto(int node, int clr) {
	if(node&1 && clr < 3) return 0;
	int a1 = binpow(clr - 1, node);
	if(node&1) a1 -= clr - 1;
	else a1 += clr - 1;
	a1 %= mod;
	if(a1 < 0) a1 += mod;
	return a1;
}
int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t = 1; cin >> t;
	while(t--) {
		int n, k, l; cin >> n >> k >> l;
		if(l < 2) {
			cout << "0\n";
			continue;
		}
		int a1 = (1LL * (l - 2) * (l - 2) % mod + l - 1) % mod;
		int ans1 = binpow(a1, 1LL * (n - 1) * k % (mod - 1));
		cout << 1LL * ans1 * koto(k, l) % mod << "\n";
	}
	return 0; 
}