Problem: 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

Solution (in PYTHON):

Solution:
def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a%b)


def main():
	test_cases = int(raw_input())
	for _ in xrange(test_cases):
		list1 = raw_input().split()
		list2 = []
		for i in xrange(len(list1)):
			list2.append(int(list1[i]))
		
		
		if list2[0]**2 == list2[1]**2 + list2[2]**2 or list2[1]**2 == list2[0]**2 + list2[2]**2 or list2[2]**2 == list2[1]**2 + list2[0]**2:
			if gcd(list2[0], list2[1]) == 1 and gcd(list2[1], list2[2]) == 1 and gcd(list2[0], list2[2]) == 1: 
				print "YES"
			else:
				print "NO"
		else:
			print "NO"
	return 0
if __name__ == "__main__":
	main()