n = int(input())

i = 0
while (i < n):
    L = map(int, raw_input().split())
    L.sort(reverse = True)

    if (pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2)):
        print "YES"
    else:
        print "NO"

    i += 1 n = int(input()) n int(input()) int input() input i = 0 i 0 while (i < n):
    L = map(int, raw_input().split())
    L.sort(reverse = True)

    if (pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2)):
        print "YES"
    else:
        print "NO"

    i += 1 i < n i n L = map(int, raw_input().split()) L map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split L.sort(reverse = True) L.sort L sort reverse = True reverse True if (pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2)):
        print "YES"
    else:
        print "NO"

     pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2) pow(L[0], 2) pow L[0] L 0 2 pow(L[1], 2) + pow(L[2], 2) pow(L[1], 2) pow L[1] L 1 2 pow(L[2], 2) pow L[2] L 2 2 print print i += 1 i 1 i = 0 0 i i += 1 1 i L = map(int, raw_input().split()) map(int, raw_input().split()) L n = int(input()) int(input()) n
n = int(input())

i = 0
while (i < n):
    L = map(int, raw_input().split())
    L.sort(reverse = True)

    if (pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2)):
        print "YES"
    else:
        print "NO"

    i += 1