#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- ll M,N,mo; ll modpow(ll a, ll n = mo-2) { ll r=1;a%=mo; while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1; return r; } ll R[6]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>M>>mo; M=modpow(M,N); FOR(i,6) { ll tar=mo*i+M; FOR(i,6) { FOR(x,1LL<<60) if(x*x>tar) break; x--; R[i]=x; tar-=x*x; if(R[i]==0) R[i]=mo; } if(tar) continue; cout<<"YES"<