#include <iostream>

template<class T, T MOD>
class Modint{
	T val;
public:
	Modint(T val = 0) : val(val % MOD + (val >= 0 ? 0 : MOD)) {}
	operator T(){ return val; }
	Modint &operator+=(const Modint &a){ val += a.val; if(val >= MOD) val -= MOD; return *this; }
	Modint &operator-=(const Modint &a){ val -= a.val; if(val < 0) val += MOD; return *this; }
	Modint &operator*=(const Modint &a){ val = val * a.val % MOD; return *this; }
	void inverse(){T x[2]={MOD,val},a[2]={0,1};int i;for(i=0;x[!i];i^=1){a[i]-=x[i]/x[!i]*a[!i];x[i]=x[i]%x[!i];}if(!i)a[i]+= MOD;val=a[i];}
	Modint &operator/=(Modint a){ a.inverse(); return *this *= a; }
	friend Modint modpow(Modint a, int n){ Modint ret(1); while(n){ if(n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
	friend Modint operator+(Modint a, const Modint &b){ return a += b; }
	friend Modint operator-(Modint a, const Modint &b){ return a -= b; }
	friend Modint operator*(Modint a, const Modint &b){ return a *= b; }
	friend Modint operator/(Modint a, const Modint &b){ return a /= b; }
	friend std::ostream &operator<<(std::ostream &os, const Modint &a){ return os << a.val; }
};

using lint = long long;
using Mint = Modint<long long, 1000000007>;

int main(){
	lint s;
	std::cin >> s;
	for(int t = 0; t < s; ++t){
		lint n, m, x;
		std::cin >> n >> m >> x;

		Mint mm = Mint(m);
		Mint plus = Mint(1) + mm;
		Mint minus = Mint(1) - mm;

		plus = modpow(plus, n);
		minus = modpow(minus, n);


		if(x == 0){
			std::cout << (plus + minus) / Mint(2) << std::endl;
		}else{
			std::cout << (plus - minus) / Mint(2) << std::endl;
		}

	}
}