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

using ll = long long;
const int M = 1e9 + 7;
int power(int x, int y) {
    int ans = 1;
    for (; y; y >>= 1, x = 1ll * x * x % M)
        if (y & 1)
            ans = 1ll * ans * x % M;
    return ans;
}

int main() {
    int T, n, k, c;
    for (cin >> T; T; T--) {
        cin >> n >> k >> c;
        if (c < 2) { cout << "0\n"; continue; }
        ll ans = 1ll * ((k & 1 ? M - 1 : 1) + power(c - 1, k - 1)) * power(c, M - 2) % M;
        ans = ans % M * c % M * (c - 1) % M;
        int t = (1ll * (c - 2) * (c - 2) + c - 1) % M;
        ans = ans * power(t, 1ll * (n - 1) * k % (M - 1));
        cout << (ans % M + M) % M << "\n";
    }
}