#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,j) rrep2(i,j,0)
#define SZ(a) ll(a.size())
#define eb emplace_back
#define all(a) a.begin(),a.end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
template<class T>
bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T>
bool chmax(T& a,T b){return a<b?a=b,1:0;}

ll eg(ll a,ll b,ll& x,ll& y){
	if(!b) return x=1, y=0, a;
	ll d=eg(b,a%b,y,x);
	y-=a/b*x;
	return d;
}

#define ln "\n"

using lint=__int128;

ll nxt(ll a,ll b,ll n){
	ll x,y; eg(a,b,x,y);
	y = lint(y)*n%a;
	if(y) y-=a;
	n-=y*b;
	return n;
}


void solve() {
	ll a,b,n;cin>>a>>b>>n;
	string ans="No";
	ll g=n;
	rep(_,70){
		ll m=nxt(a,b,n);
		if(n<g && g<=m && (g-n)%b==0) ans="Yes";
		n=m;
		while(n%a==0){
			n/=a;
			if(n==g) ans="Yes";
		}
	}
	cout<<ans<<ln;
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	ll t;cin>>t;
	while(t--) solve();
}