import java.lang.Math.*;
import java.util.Scanner;
import java.util.Arrays;

class Main{
    public static void main(String[] args){
	final Scanner sc = new Scanner(System.in);
	int n=sc.nextInt();
	int[] a=new int[3]; 
	for(int i=0;i<n;i++){
	    a[0]=sc.nextInt();
	    a[1]=sc.nextInt();
	    a[2]=sc.nextInt();
	    Arrays.sort(a);	    
	    if(Math.pow(a[2],2)==Math.pow(a[0],2)+Math.pow(a[1],2)) System.out.println("YES");
	    else System.out.println("NO");
	}
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz