#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define popcount __builtin_popcount
#define case cout<<"Case "<<__testcase-testcase<<":";
#define endl '\n'
const ll mod=1e9+7;
ll power(ll a,ll n=mod-2){
    ll ans=1ll;
    a = (mod+a)%mod;
    n%=(mod-1);
    while(n){
        if(n&1ll) ans=(ans*a)%mod;
        a=(a*a)%mod;
        n>>=1;
    }
    return ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int testcase=1;
    cin>>testcase;
    int __testcase=testcase;
    while(testcase--)
    {
        ll n,m,i,j,k,l;
        cin>>n>>k>>l;
        if(l<2){
            cout<<0<<endl;
            continue;
        }
        ll ans=power((l-1)+(l-2)*(l-2), n*k-k);
        ll temp;
        ll x=l-1;
        if(k%2==0){
            temp = (power(x,k)-1)*power(x+1) %mod;
            temp = (temp+1)%mod;
            temp = (temp*l)%mod;
        }
        else{
            temp = (power(x,k)+1)*power(x+1) %mod;
            temp = (mod+temp-1)%mod;
            temp = (temp*l)%mod;
        }

        cout<<(ans*temp %mod)<<endl;

    }
}