#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2e5 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

const ll mod = 1e9 + 7;

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

ll add(ll a, ll b){
    a += b;
    a %= mod;
    return a;
}

ll mul(ll a, ll b){
    a %= mod;
    a *= b;
    a %= mod;
    return a;
}

void solve(){
    ll n, k, y;
    cin >> n >> k >> y;

    ll res = mul(add(binpow(y - 1, k), mul(binpow(-1, k), (y - 1))), binpow(binpow(y * y - 3 * y + 3, n - 1), k));
    while(res < 0){
        res += mod;
    }
    cout << res << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}