#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main(void){
	int n; cin >> n;
	
	while(n --){
		vector<int> edge(3);
		for(int i = 0; i < 3; i ++) cin >> edge[i];

		sort(edge.begin(), edge.end());
		
		cout << ((pow(edge[0], 2) + pow(edge[1], 2) == pow(edge[2], 2)) ? "YES":"NO") << endl;
	}

	return 0;
}