#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<algorithm>

#define LL long long
#define inf 0x3f3f3f3f
#define eps 1e-8

#define BUG printf("bugbugbug\n");

using namespace std;

const int maxn = 3000 + 10;

bool dp[2][maxn];
int x[maxn],y[maxn],k[maxn],M[maxn];
int main()
{
    int a,b,c,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&a,&b,&c);
        int n=0,m=0;
        for (int i=1;i<=sqrt(a+1);i++)
        {
            if (a%i==0)
            {
                n++;
                x[n]=i;
                y[n]=a/i;
            }
        }
        for (int i=1;i<=sqrt(c+1);i++)
        {
            if (c%i==0)
            {
                m++;
                k[m]=i;
                M[m]=c/i;
            }
        }
        bool flag=0;
        for (int i=1;i<=n;i++)
        {
            for (int j=1;j<=m;j++) if (y[i]*k[j]+x[i]*M[j] == b)
            {
                flag=1;
                break;
            }
        }
        for (int i=1;i<=n;i++)
        {
            for (int j=1;j<=m;j++) if (x[i]*k[j]+y[i]*M[j] == b)
            {
                flag=1;
                break;
            }
        }
        if (flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}