#include <bits/stdc++.h>

#define int int64_t
#define endl '\n'

using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b){
    int ret = (a*1ll + b) %MOD;
    if(ret < 0 ) ret += MOD;
    return ret;
}

int mul(int a, int b){
    int ret = (a*1ll * b)%MOD;
    if(ret < 0) ret += MOD;
    return ret;
}

int pow_exp(int n, int p){
    if(!p) return 1;
    if(p&1) return mul(n, pow_exp(n, p-1));
    int ret = pow_exp(n, p/2);
    return mul(ret, ret);
}

int inv(int n){
    return pow_exp(n, MOD-2);
}

int calc(int st, int q, int n){

    int a0 = add(pow_exp(q, n-1), -1);
    int a1 = add(q, -1);
    int a = mul(a0, inv(a1));

    return mul(st, a);
}

int32_t main()
{

    int t; cin >> t; while(t--){

        int n, k, l;
        cin >> n >> k >> l;

        if(l < 2){
            cout << 0 << endl;
            continue;
        }

        int a0 = mul(l-2, l-2);
        int a1 = add(a0, l-1);
        int a = pow_exp(a1, ((n-1)*k) % (MOD-1));

        int b0 = calc(mul(l-1, l-1), mul(l-1, l-1), k/2);
        int b1 = calc(l-1, mul(l-1, l-1), (k+1)/2);
        int b = k%2==0 ? add(b0, -b1) : add(b1, -b0);
        b = mul(b, l);

        int ans = mul(a, b);

        cout << ans << endl;

    }
}