#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define all(v) v.begin(), v.end()
#define prs(v) sort(all(v)); v.erase(unique(all(v)), v.end())
using namespace std;

constexpr int mod = 1'000'000'007;

auto modpow(int base, int exp) {
    int res = 1;
    while (exp) {
        if (exp & 1) res = res * base % mod;
        base = base * base % mod;
        exp >>= 1;
    }
    return res;
}

auto sum_of_ratio(int a, int n, int r) {
    return a * (modpow(r, n) - 1 + mod) % mod * modpow(r - 1, mod - 2) % mod;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;

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

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

        if (l == 2) {
            if (k & 1) cout << 0 << endl;
            else cout << 2 << endl;
            continue;
        }
        
        int include = sum_of_ratio((k & 1) ? (l - 1) * (l - 1) % mod : (l - 1), k / 2, (l - 1) * (l - 1) % mod);
        int exclude = sum_of_ratio((k & 1) ? (l - 1) : (l - 1) * (l - 1) % mod, (k - 1) / 2, (l - 1) * (l - 1) % mod);
        int sum = l * (include - exclude + mod) % mod;
        int res = sum * (modpow(modpow(((l * l - 3 * l + 3) % mod + mod) % mod, n - 1), k)) % mod;
        cout << res << endl;
    }
}