import std.stdio;
import std.math;
import std.algorithm;

void main(){
 int n;
 readf("%d\n",&n);
 for(int i=0;i<n;i++){
	int[3] a;
	readf("%d %d %d\n",&a[0],&a[1],&a[2]);
	a.sort;
	if(pow(a[2],2) == pow(a[0],2) + pow(a[1],2))
	 writeln("YES");
	else
	 writeln("NO");
 }
}