#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define INF (1ll<<62)
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
#define bug puts("===========");
const double pi=(acos(-1.0));
const double eps=1e-8;
const int inf=1e9+10;
const int maxn=1e5+5;
const int mod=1e9+7;
/*===============================*/
ll x[maxn],y[maxn];
int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--){
        ll a,b,c;
        int cnt=0;
        scanf("%I64d%I64d%I64d",&a,&b,&c);
        for(int i=1;i*i<=a;i++){
            if(a%i==0){
                x[cnt]=i;
                y[cnt++]=a/i;
            }
        }
        int flag=0;
        for(int i=1;i*i<=c;i++)
        if(c%i==0){
            for(int j=0;j<cnt;j++)
                if(x[j]*i+c/i*y[j]==b||y[j]*i+c/i*x[j]==b){
                flag=1;
                break;
            }
            if(flag) break;
        }
        if(flag) puts("YES");
        else puts("NO");
    }
    return 0;
}