#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#define inf 0x3f3f3f3f
#define mod 9999991
using namespace std;
void fre(){freopen("d://input.txt","r",stdin);freopen("d://output.txt","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=y;i>=x;i--)
typedef __int64  LL;
const int N=26;
vector<int> v1[2],v2[2];
int main(){
int t,a,b,c;
scanf("%d",&t);
while(t--){
        rep(i,0,1){v1[i].clear();v2[i].clear();}
scanf("%d %d %d",&a,&b,&c);
int x=sqrt(a);
 rep(i,1,x){
  if(a%i==0){
     v1[0].push_back(i);v1[1].push_back(a/i);}
 }
 x=sqrt(c);
 rep(i,1,x){
  if(c%i==0){
     v2[0].push_back(i);v2[1].push_back(c/i);}
 } int flag=0;
 rep(i,0,v1[0].size()-1){

  rep(j,0,v2[0].size()-1){
   if(v1[0][i]*v2[0][j]+v1[1][i]*v2[1][j]==b ||
   v1[0][i]*v2[1][j]+v1[1][i]*v2[0][j]==b  ){
        flag=1;
        break;
        }
  }
  if(flag) break;
 }
 if(flag) puts("YES");
 else puts("NO");
}
return 0;
}