Problem:
Is it a Right Triangle?

Write a program which judges wheather given length of three side form a right triangle. Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.

Input

Input consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.

Constraints

1 ≤ length of the side ≤ 1,000

N ≤ 1,000

Output

For each data set, print "YES" or "NO".

Sample Input

3
4 3 5
4 3 6
8 8 8

Output for the Sample Input

YES
NO
NO

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

class Main {

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

      

        int times = scan.nextInt();

        int[][] delta = new int[times][3];

        for (int i = 0; i < times; i++) {

            int edge1 = scan.nextInt();
            int edge2 = scan.nextInt();
            int edge3 = scan.nextInt();

            delta[i][0] = edge1;
            delta[i][1] = edge2;
            delta[i][2] = edge3;

        }

        for (int i = 0; i < times; i++) {
            if ((delta[i][0]) * (delta[i][0]) == (delta[i][1]) * (delta[i][1]) + (delta[i][2]) * (delta[i][2])
                    || (delta[i][1]) * (delta[i][1]) == (delta[i][0]) * (delta[i][0]) + (delta[i][2]) * (delta[i][2])
                    || (delta[i][2]) * (delta[i][2]) == (delta[i][0]) * (delta[i][0]) + (delta[i][1]) * (delta[i][1])) {

                System.out.println("YES");
            } else {
                System.out.println("NO");
            }
        }

        scan.close();

    }

}