#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define int long long
#define ll long long 
#define lll __int128_t
#define pb push_back
// #define double long double
#define pii pair<int,int>
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
typedef pair<double, double> pdd;
const double EPS = 1e-12;


typedef vector<vector<int>> matrix;

const int mod = 1e9 + 7;

matrix mul(matrix a, matrix b){
    int n = a.size();
    matrix c(n, vector<int>(n));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n;k++){
                c[i][j] += a[i][k]*b[k][j] % mod;
                c[i][j] %= mod;
            }
        }
    }
    return c;
}

long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

matrix power(matrix a, int b){
    int n = a.size();
    matrix res(n, vector<int>(n));
    for(int i=0;i<n;i++) res[i][i] = 1;
    while(b){
        if(b&1) res = mul(res, a);
        a = mul(a, a);
        b >>= 1;
    }
    return res;
}

void solve(){
    int n, k, l;
    cin >> n >> k >> l;    

    matrix b = {
        {0, 1},
        {l-1, l-2},    
    };
    matrix a = {
        {l},
        {0},
    };

    matrix res = mul(power(b, k-1), a);
    int val = res[1][0];

    int e = (l * l - 3*l + 3) % mod;
    e = binpow(e, n-1, mod);
    e = binpow(e, k, mod);
    cout << (e * val) % mod << "\n";



}
signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tc;
    cin>>tc;
    while(tc--)
    solve();
    
    return 0;
}