解析:(来自洛谷题解)
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,a,b;
void solve(){
scanf("%lld%lld%lld",&n,&a,&b);
if(n==1||b==1) puts("Yes");
else if(a==1){
if(n%b==1) puts("Yes");
else puts("No");
}
else{
int f=0,p=n%b;
for(int i=1;i<=n;i*=a){
if(i%b==p){
f=1;
break;
}
}
if(f) puts("Yes");
else puts("No");
}
}
signed main(){
int t=1;
scanf("%lld",&t);
while(t--) solve();
return 0;
}