#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <memory.h>
#include <set>
#include <string.h>
#include <list>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <time.h>
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(int i=1;i<=n;++i)
#define repc(i,l,r) for(int i=l;i<=r;++i)
#define mp(a,b) make_pair(a,b)
#define llf long double
#define pii pair<int,int>
using namespace std;
int x[10000];
int y[10000];
int tx, ty;
void get(int *x,int a,int &tol){
    rep(i, a){
        if ((ll)i*i >= a){
            if ((ll)i*i == a) x[tol++] = i;
            break;
        }
        if (a%i == 0){
            x[tol++] = i;
            x[tol++] = a / i;
        }
    }
}
void solve(){
    int a, b, c;
    cin >> a >> b >> c;
    tx = ty = 0;
    get(x, a, tx);
    get(y, c, ty);
    forn(i, tx)forn(j, ty){
        if ((ll)x[i] * y[j] + (ll)a*c / x[i] / y[j] == b){
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}
int main(int argc,char *argv[]){
//    freopen("abc.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--){
        solve();
    }
    return 0;
}