#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=14449999999999994;
ll mod=1000000007;
ll modpow(ll x, ll n) {
  x = x%mod;
  if(n==0) return 1;  //再帰の終了条件

  else if(n%2==1) {
    return (x*modpow(x, n-1))%mod;  //nが奇数ならnを1ずらす
  }
  else return modpow((x*x)%mod, n/2)%mod;  //nが偶数ならnが半分になる
}
int main(){
    ll s;
    cin >> s;
    for (ll o = 0; o < s; o++)
    {
        ll n,m,x;
        cin >> n >> m >> x;
        ll y=modpow(1+m,n);
        ll z=modpow(1-m,n);
        if (x==0)
        {
            ll ans=y+z;
            ans%=mod;
            ans+=mod;
            ans%=mod;
            ans*=inv_mod(2,mod);
            ans%=mod;
            cout << ans << endl;
        }else{
            ll ans=y-z;
            ans%=mod;
            ans+=mod;
            ans%=mod;
            ans*=inv_mod(2,mod);
            ans%=mod;
            cout << ans << endl;
        }
        
    }
    
}