#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size();
#define rep(i,j,k) for (int i = j; i < (k); i++)
#define in(mp, v) (mp.find(v) != mp.end())
#define smx(a, b) a = max(a, b)
#define smn(a, b) a = min(a, b)
#define pb push_back
#define endl '\n'

const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;

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(0)->sync_with_stdio(0);

    int t; cin >> t;
    while (t--) {
        ll n, k, l; cin >> n >> k >> l;
        if (l < 2 || (k % 2 == 1 && l < 3)) {
            cout << 0 << "\n";
            continue;
        }

        ll p1 = modpow(l - 1, k);
        p1 += (k % 2 == 1 ? -1 : 1) * (l - 1);
        while (p1 < 0) {
            p1 += MOD;
        }
        p1 %= MOD;

        ll p = (l * l - 3 * l + 3 + 5 * MOD) % MOD;
        ll p2 = modpow(p, (n - 1) * k);

        cout << p1 * p2 % MOD << "\n";
    }
}