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:
from fractions import gcd

def isPithagorean(a, b, c):
	if a**2 + b**2 == c**2 or a**2 + c**2 == b**2 or b**2 + c**2 == a**2:
		return True
	return False

def isCoPrime(a, b, c):
	if gcd(a,b) == 1 or gcd(a,c) == 1 or gcd(b,c) == 1:
		return True
	return False

def isPrimitivePythagorean(a, b, c):
	if isPithagorean(a, b, c) and isCoPrime(a, b, c):
		return True
	return False

T = int(raw_input())
for test in range(T):
	string = raw_input()
	length = len(string)
	
	spaces = []
	for i in range(length):
		if string[i] == ' ':
			spaces.append(i)
	
	a = int(string[0:spaces[0]])
	b = int(string[spaces[0]:spaces[1]])
	c = int(string[spaces[1]:length])
	
	if isPrimitivePythagorean(a, b, c):
		print("YES")
	else:
		print("NO")