#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
#define int long long
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mod=998244353;
int qpow(int a,int p)
{
	int mul=1;
	for(;p;p>>=1)
	{
		if(p&1) mul=1ll*mul*a%mod;
		a=1ll*a*a%mod;
	}
	return mul;
}
inline void getmod(int &x)
{
	x-=(x>=mod)*mod;
}
int check(int p,int q,int ed,int mod)
{
	if(p>=mod||q>=mod||ed>=mod) return -1;
	int rd=1ll*ed*q%mod;
	if(1ll*rd*p%mod==ed) return rd;
	return -1;
}
signed main()
{
	int T=read();
	while(T--)
	{
		int p=read(),q=read(),ed=read(),i,v=p*q-1;
		vector<int> res;
		for(i=2;i*i<=v;i++)
			if(v%i==0)
			{
				for(;v%i==0;v/=i);
				int u=check(p,q,ed,i);
				if(~u) res.push_back(u);
			}
		if(v>1)
		{
			int u=check(p,q,ed,v);
			if(~u) res.push_back(u);
		}
		if(res.size()==1) printf("%lld\n",res[0]);
		else puts("shuanQ");
	}
}