#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
ll fst(ll x,ll y,ll m){
	if (y==0)return 1;
	if (y&1)return x*fst(x,y-1,m)%m;
	ll p=fst(x,y/2,m);return p*p%m;
}
ll gcd(ll x,ll y){
	if (y==0)return x;
	return gcd(y,x%y);
}
int main(){
	freopen ("gcmod.in","r",stdin);
	freopen ("gcmod.out","w",stdout);
	int T;scanf("%d",&T);
	while(T--){
		ll a,b,n;scanf("%lld%lld%lld",&a,&b,&n);
		if(a==b){
			printf("%lld\n",(fst(a,n,mod)+fst(b,n,mod))%mod);
			continue;
		}
		if (a<b)swap(a,b);
		printf("%lld\n",gcd(a-b,(fst(a,n,a-b)+fst(b,n,a-b))%(a-b))%mod);
	}
	return 0;
}