#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000007;
ll qpow(ll a, ll b)
{
    ll ans = 1;
    a %= mod;
    for (; b;b >>= 1) {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
    }
    return ans % mod;
}
/*---------------------------------------*/

void solve()
{
    ll n, k, m;
    cin >> n >> k >> m;
    ll ans = 0;
    if (k % 2 == 0)
        ans = qpow(m - 1, k) + m - 1;
    else
        ans = qpow(m - 1, k) - m + 1;
    (ans += mod) %= mod;

    (ans *= qpow(qpow(m * m - 3 * m + 3, n - 1), k)) %= mod;
    cout << ans << '\n';
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}