#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#define endl '\n'
#define int long long

using namespace std;

const int N = 2e5+10 , M = 1e6+10 , mod = 1e9+7;

int k[N];
int n,m,x;

int ksm(int base,int power) {
    int ans=1;
    while(power) {
        if(power & 1) ans = ans * base % mod;
        power >>= 1;
        base = base * base % mod;
    }
    return ans;
}

void solve(){
    int d;
    cin >> n >> m >> d;
    n = n % mod * m % mod;
    cout << ksm(m,d) % mod * n %mod << endl;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0) , cout.tie(0);
    int T = 1;
    cin >> T ;
    while(T--) solve();
    return 0;
}