/*input
2
2 3 3
1000000000 1000000000 3
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int pw(int a, int b)
{
	if (b == 1) return a;
	if (b == 0) return 1;
	int mid = pw(a, b / 2);
	mid = mid * mid % mod;
	if (b & 1) return mid * a % mod;
	return mid;
}
main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin  >> t;
	while (t-- > 0)
	{
		int n, k, A;
		cin >> n >> k >> A;
		cout << /*(A*(A-2)%mod*pw(A-1,k-2)%mod)*/((pw(-1,n)+mod*mod)%mod*(A-1)%mod+pw(A-1,n))%mod
		*pw(pw((pw(A-2,2)+A-1)%mod,n-1),k)%mod << '\n';
	}
	return 0;
}