#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline ll read()
{
	char c=getchar();ll x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
// modint
#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair 
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,k;
int c;

struct mat{
	modint f[2][2];
	modint*operator [](int x){return f[x];}
};
mat operator *(mat a,mat b){
	mat c;
	For(i,0,1)For(k,0,1)For(j,0,1)c[i][j]+=a[i][k]*b[k][j];
	return c;
}
mat qpow(mat a,int b){
	mat res=a;--b;
	for(;b;b>>=1,a=a*a)if(b&1)res=res*a;
	return res;
}

void work()
{
	n=read(),k=read();
	c=read();
	if(!c){
		puts("0");
		return;
	}
	modint w=max(c-1,0);
	w+=1ll*max(c-2,0)*max(c-2,0)%mod;
	modint res=qpow(w,1ull*(n-1)*k%(mod-1));
	mat tmp;
	tmp.f[0][0]=max(c-2,0);
	tmp.f[1][0]=max(c-1,0);
	tmp.f[0][1]=1;
	tmp=qpow(tmp,k-1);
	modint sum=tmp.f[1][0];
	sum*=c;
	//cout<<sum.x<<"\n";
	res=res*sum;
	cout<<res.x<<"\n";
}

signed main()
{
	
	int T=read();
	while(T--)work();
	return 0;
}