#include <bits/stdc++.h>
#define ll long long
const ll mod =(int)1e9+7;
using namespace std;
ll inv(ll i)
{
    if (i == 1)
        return 1;
    return (mod - mod / i) * inv(mod % i) % mod;
}
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,k,mod);
    return ggg%mod;
}
ll f(ll k,ll x)
{
    ll ans=x* qPow(x-1,k-1,mod)%mod;
    return ans;
}
ll ans_k(ll n,ll k,ll x)
{
    ll ans_3=x*(x-1)%mod*(x-2)%mod;
    if(k==3)
    {
        return ans_3;
    }
    ll a1=f(4,x);
    if(k==4)
    {
        return ((a1-ans_3)%mod+mod)%mod;
    }
    ll q=-(x-1);
    ll S=a1*(1- qPow(q,k-3,mod))%mod*inv(((1-q)%mod+mod)%mod)%mod;
    if(k&1)
    {
        S=((-S)%mod+mod)%mod;
        return ((S+ans_3)%mod+mod)%mod;
    }
    else
    {
        return ((S-ans_3)%mod+mod)%mod;
    }
}
int main()
{
    int l;
    cin>>l;
    while (l--)
    {
        ll n,k,x;
        cin>>n>>k>>x;
        if(x<=1)
        {
            cout<<0<<"\n";
            continue;
        }
        if(x==2)
        {
            if(k&1)
            {
                cout<<0<<"\n";
                continue;
            }
            else
            {
                cout<<2<<"\n";
                continue;
            }
        }
        ll ans=g(n,k,x)*ans_k(n,k,x)%mod;
        cout<<ans<<"\n";
    }
    return 0;
}