#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;


int main(){
    int x;
    vector<int> nums;
    nums.resize(3,0);
    cin >> x;
    while( 0 <= --x ){
        int a,b,c;
        cin >> nums[0] >> nums[1] >> nums[2];
        sort(nums.begin(), nums.end());
        if( pow(nums[0], 2) + pow(nums[1], 2) == pow(nums[2], 2)){
            cout << "YES" << endl;
        }else{
            cout << "NO" << endl;
        }
    }


    return 0;
}