Paul was the most famous character in Tekken-3. Of course he went to college and stuff. In one of the exams he wasn't able to answer a question which asked to check if a tuple of 3 non negative integers constituted a Primitive Pythagorian Triplet or not.  Paul was not able to answer it correctly and henceforth, he could not concentrate on any fight for a very long time and lost most of them. So, he decided to learn everything about Primitive Pythagorian Triplets.

Now, Paul seeks your help to determine whether a given triplet is a Primitive Pythagorian Triplet or not.

INPUT :  

The first line of the input contains the number of test cases T.
Every test case has a single line containing 3 space separated integers a,b and c.

OUTPUT :   

The output to each test case is a "YES" or a "NO".

CONSTRAINTS :   

1 ≤ T ≤ 100000

0 ≤ a,b,c ≤ 10000000

NOTE:
A primitive Pythagorean triple is one in which a, b and c are coprime.

SAMPLE INPUT
4
3 4 5
10 8 6
9 2 5
12 5 13

SAMPLE OUTPUT
YES
NO
NO
YES
# Read input from stdin and provide input before running code
def GCD(a, b):

    if b == 0:
        return a
    else:
        return GCD(b, a % b)

def pythagorus(a,b,c):
	a2=a*a
	b2=b*b
	c2=c*c
	
	gcd1=reduce(GCD, (a,b,c))
	
	if (a2+b2==c2 and gcd1==1) :
		return 1
	else:
		return 0

t = int(raw_input())


for i in range(t):
	a,b,c=raw_input().split()
	result=0
	result=result+pythagorus(int(a),int(b),int(c))
	result=result+pythagorus(int(c),int(b),int(a))
	result=result+pythagorus(int(a),int(c),int(b))
	if (result >0):
		print "YES"
	else :
		print "NO"