#include<bits/stdc++.h>
using namespace std;
int T;
#define ll long long
const ll mod = 1e9+7;
ll ksm(ll x,ll y)
{
    x%=mod;
    y%=mod-1;
    ll sum = 1;
    while (y)
    {
        if (y&1) sum = sum * x % mod;
        x=x*x%mod;
        y>>=1;
    }
    return sum;
}
void work()
{
    ll n,k,l;
    scanf("%lld%lld%lld",&n,&k,&l);
    ll sum1=ksm((l-2)*(l-2)+l-1,n-1);
    ll sum2=ksm(sum1,k);
    ll sum3=0;
    if (k&1) sum3=(1-l)*(1-ksm(1-l,k-1))%mod;
    else sum3=(l-1)*(1-ksm(1-l,k-1))%mod;
    //cout << sum3<<" \n";
    sum3%=mod;
    sum3=sum3*sum2%mod;
    sum3=(sum3+mod)%mod;
    printf("%lld\n", sum3);
}
int main()
{
    cin >> T;
    while (T--)
    {
        work();
    }
    return 0;
}