#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const ll mod = 1000000007;

ll modpow(ll b, ll e) {
    ll ans = 1;
    for (; e; b = b * b % mod, e /= 2)
        if (e & 1) ans = ans * b % mod;
    return ans;
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    int t;
    cin >> t;

    while(t--){
        ll n, k, l;
        cin >> n >> k >> l;

        if(l < 2){
            cout << "0\n";
            continue;
        }

        ll spurs = (n == 1 ? 1 : modpow((n - 1) * ((l - 1) + modpow(l - 2, 2)) % mod, k));
        ll ring =  l * modpow(l - 1, k - 1) % mod - l * modpow(l - 1, k - 2) % mod;
        
        ring %= mod;

        if(ring < 0)
            ring += mod;

        cout << ring * spurs % mod  << "\n";
    }
}