#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll MOD = 1e9 + 7;

ll fpow(ll a, ll b) {
	ll ret = 1;
	while (b) {
		if (b & 1) ret = (ret * a) % MOD;
		a = (a * a) % MOD;
		b >>= 1;
	}
	return ret;
}

void solve() {
	ll n, k, v;
	cin >> n >> k >> v;
	if (v <= 1) {
		cout << 0 << '\n';
		return;
	}
	ll cyc = fpow(v - 1, k);
	ll tmp = ((k & 1) ? -1 : 1);
	cyc = (cyc + (v - 1) * tmp) % MOD;
	ll sides = ((v - 1) * (v - 1) - (v - 2)) % MOD;
	sides = fpow(sides, (n - 1) * k) % MOD;
	ll ans = (sides * cyc) % MOD;
	if (ans < 0) ans += MOD;
	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	int tc;
	cin >> tc;
	for (int i = 0; i < tc; i++) {
		solve();
	}

	return 0;
}