#include<bits/stdc++.h>

using namespace std;
using lint = int64_t;
const lint MOD = 1000000007;

lint mod(lint x){
    x %= MOD;
    x += MOD;
    x %= MOD;
    return x;
}

lint modpow(lint x, lint e){
    lint r = 1;
    for(; e; e >>= 1){
        if(e & 1) r = mod(r * x);
        x = mod(x * x);
    }
    return r;
}


void solve(){
    lint n, k, l;
    cin>>n>>k>>l;
    if(l < 2){
        cout<<"0\n";
        return;
    }
    if(l == 2){
        if(k % 2 == 0) cout<<"2\n";
        else cout<<"0\n";
        return;
    }

    lint cycle = modpow(-1,k) * modpow(l-1, k) + l - 1;
    cycle = mod(modpow(-1, k) * cycle);
    
    lint ladder = modpow( modpow((l-2) * (l-2) + l-1, n-1) , k );

    lint answer = mod(ladder * cycle);

    cout<<answer<<"\n";


}

int main(){
    cin.tie(0)->sync_with_stdio(false);
    int t; cin>>t;
    while(t--){
        solve();
    }
    return 0;
}