#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int T,n,k,c;
int pw(int x,int p){
	int bs=1;
	while(p){
		if(p&1)bs=bs*x%mod;
		x=x*x%mod;p>>=1;
	}return bs;
}signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cin>>T;
	while(T--){
		cin>>n>>k>>c;
		if(!c){
			cout<<"0\n";
			continue;
		}int ans=(pw(c-1,k)+pw(mod-1,k)*(c-1))%mod;
		ans=ans*pw(((c-1)*(c-1)-(c-2)+mod)%mod,k*(n-1)%(mod-1))%mod;
		cout<<ans<<"\n";
	}return 0;
}