/*

https://yukicoder.me/problems/no/1258

行列累乗では？
dp[i][x] = i番目までのコインを投げて、表がx(mod2で)回出たときのスコア

表が出たとき
dp[i+1][x^1] += dp[i][x] * M
裏が出たとき
dp[i+1][x] += dp[i][x]

*/

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

#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)
using ll = long long;
const ll mod = 1000000007;

vector<vector<ll>> matrix_mul(vector<vector<ll>> A,vector<vector<ll>> B){
    vector<vector<ll>> ans(A.size(),vector<ll> (B[0].size(),0));

    rep(ai,0,A.size()){
        rep(bj,0,B[0].size()){

            ll now = 0;
            rep(same,0,A[0].size()){
                now += A[ai][same] * B[same][bj];
            }

            if (mod > 0){
                ans[ai][bj] = now % mod;
            }else{
                ans[ai][bj] = now;
            }
        }
    }

    return ans;
}

vector<vector<ll>> matrix_pow(vector<vector<ll>> A,ll x){
    vector<vector<ll>> B(A.size(),vector<ll> (A[0].size(),0));
    rep(i,0,A.size()){
        rep(j,0,A[0].size()){
            B[i][j] = A[i][j];
        }
    }

    vector<vector<ll>> ans(A.size(),vector<ll> (A[0].size(),0));
    rep(i,0,A.size()) ans[i][i] = 1;

    while (x > 0){
        if (x % 2 == 1){
            ans = matrix_mul(ans,B);
        }
        B = matrix_mul(B,B);
        x /= 2;
    }
    return ans;
}

int main(){

    int S;
    scanf("%d",&S);
    rep(loop,0,S){
        ll N,M,X;
        scanf("%lld %lld %lld",&N,&M,&X);
        vector<vector<ll>> A = {{1,0}};
        vector<vector<ll>> H = {{1,M},{M,1}};
        vector<vector<ll>> ans = matrix_mul(A , matrix_pow(H,N));
        printf("%lld\n",ans[0][X]);
    }
}