#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; vector getDivisor(long long n){ vector ret; for(long long i=1;i*i<=n;i++){ if(n%i==0){ ret.push_back(n/i); if(i != n/i)ret.push_back(i); } } sort(ret.begin(),ret.end()); return ret; } int main() { int T; cin >> T; while(T--){ int a,b,c; cin >> a >> b >> c; vector v = getDivisor(a); vector v2 = getDivisor(c); for(int i = 0 ; i < v.size() ; i++){ long long p = v[i]; for(int j = 0 ; j < v2.size() ; j++){ long long k = v2[j]; int m = c / k; int q = a / p; if( 1ll * q * k + 1ll * m * p == b ){ cout << "YES" << endl; goto ok; } } } cout << "NO" << endl; ok:; } }