#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;

long long binpow(long long a, long long b, long long m = mod) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

ll modinv(ll a){
    return binpow(a, mod-2);
}

void solv(int ces){
    ll n,k,x;
    cin>>n>>k>>x;
    if(x<=2){
        cout<<"0\n";
    }
    else{
        ll ans = binpow(x*x-3*x+3, (n-1)*k);
        ans = (ans * binpow(x-1, k-1)) % mod;
        ll Y = (1-x + mod) % mod;
        ll Z = (modinv(binpow(Y, k-2)) + x-1) % mod;
        ans = (ans * Z) % mod;
        cout<<ans<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);


    int tc = 1;
    cin>>tc;
    for(int ces=1; ces<=tc; ces++){
        solv(ces);
    }

    return 0;
}