#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll=long long;

const int MOD=1e9+7;
ll qpow(ll x,ll y){
	x+=MOD;
	x%=MOD;
	ll res=1;
	for(;y;y>>=1){
		if(y&1)res*=x,res%=MOD;
		x*=x;
		x%=MOD;
	}
	return res;
}


int cal(){
	ll n,k,l;cin>>n>>k>>l;
	ll ans=qpow(l*l-3*l+3,k*(n-1));
	if(l<2)return 0;
	ans*=(qpow(l-1,k)+qpow(-1,k)*(l-1)%MOD)%MOD;
	ans%=MOD;
	return ans;
}
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--){
		cout<<cal()<<endl;
	}
	return 0;
}
// init?
// var->0?
// infinite dfs?
// out of bound?
// max_element / min_element?