#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define IOS cin.tie(0);ios_base::sync_with_stdio(false);
#define INF 1e15+9
using namespace std;
const int maxn = 2e5+5;
typedef pair<int,int> P;
const int MOD = 1e9 + 7;
int pow(int now,int k){
    if(k <= 0) return 1;
    if(k == 1) return now % MOD;
    if(k % 2){
        int tmp = pow(now,k-1);
        return (now * tmp) % MOD;
    }
    else{
        int tmp = pow(now,k / 2);
        return (tmp * tmp) % MOD;
    }
}
void solve(){
    int n,k,l;
    cin >> n >> k >> l;
    int fl;
    if(k % 2) fl = -1;
    else fl = 1;
    int in = (pow(l - 1,k) + fl * (l - 1)) % MOD;
    //int in = ((l * ((pow(l - 1,k - 3) * 1 * (l - 1)) % MOD)) % MOD) + ((((l * pow(l - 1,k - 2)) % MOD) * (l - 1)) % MOD) % MOD;
    int tmp = (l * l - 3 * l + 3) % MOD;
    int num = (n - 1) * k;
    cout << (in * pow(tmp,num)) % MOD;
    cout << '\n';
    //cout << in;
}

signed main(){IOS
    int T;
    cin >> T;
    while(T--){
        solve();
    }
}