#include <bits/stdc++.h>
#define ll long long
const ll mod =(int)1e9+7;
using namespace std;
inline ll qMul(ll a, ll b, ll mod)
{
    ll tmp = (a * b - (ll)((long double)a / mod * b + 1.0e-8) * mod);
    return tmp < 0 ? tmp + mod : tmp;
}
// 快速幂
ll qPow(ll base, ll power, ll mod)
{
    ll ans = 1;
    while (power)
    {
        if (power & 1)
        {
            ans = qMul(ans, base, mod);
        }
        base = qMul(base, base, mod);
        power >>= 1;
    }
    return ans % mod;
}
ll g(ll n,ll k,ll x)
{
    ll o=(x-2)*(x-2)%mod+2*(x-2)%mod;
    o=o%mod;
    ll gg= qPow(o,n-1,mod);
    ll ggg= qPow(gg,x,mod);
    return ggg%mod;
}
ll f(ll n,ll k,ll x)
{
    ll ans1=x* qPow(x-1,k-1,mod)%mod;
    ll ans2=x* qPow(x-1,k-2,mod)%mod;
    ll ans=((ans1-ans2)%mod+mod)%mod;
    return ans;
}
int main()
{
    int l;
    cin>>l;
    while (l--)
    {
        ll n,k,x;
        cin>>n>>k>>x;
//        cout<<f(n,k,x);
        ll ans=g(n,k,x)*f(n,k,x)%mod;
        cout<<ans<<"\n";
    }
    return 0;
}