/**
 * @author yuichirw
 *
 */
import java.util.*;
import static java.util.Arrays.*;

public class Main {
	static int n;
	static int[] edges = new int[3];
	static Scanner sc = new Scanner(System.in);
	
	static void read() {
		for(int i = 0; i < 3; i++) {
			edges[i] = sc.nextInt();
		}
	}
	
	static String solve() {
		sort(edges);
		int a,b,c;
		a = edges[0]; b = edges[1]; c = edges[2];
		if((a * a + b * b) == (c * c)) {
			return "YES";
		} else {
			return "NO";
		}
	}
	
	public static void main(String[] args) {
		n = sc.nextInt();
		while(n-- > 0) {
			read();
			System.out.println(solve());
		}
	}
}
/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