#!/usr/bin/env python3
def right_triangle(edge):
    # a < b < c
    return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2)

n = int(input())
for i in range(n):
    edge = sorted([int(x) for x in input().split()])
    if right_triangle(edge):
        print("YES")
    else:
        print("NO") def right_triangle(edge):
    # a < b < c
    return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2) right_triangle return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2) edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2 edge[0] ** 2 + edge[1] ** 2 edge[0] ** 2 edge[0] edge 0 2 edge[1] ** 2 edge[1] edge 1 2 edge[2] ** 2 edge[2] edge 2 2 edge edge n = int(input()) n int(input()) int input() input for i in range(n):
    edge = sorted([int(x) for x in input().split()])
    if right_triangle(edge):
        print("YES")
    else:
        print("NO") i range(n) range n int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x edge = sorted([int(x) for x in input().split()]) edge sorted([int(x) for x in input().split()]) sorted [int(x) for x in input().split()] if right_triangle(edge):
        print("YES")
    else:
        print("NO") right_triangle(edge) right_triangle edge print("YES") print "YES" print("NO") print "NO" def right_triangle(edge):
    # a < b < c
    return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2) def right_triangle(edge):
    # a < b < c
    return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2) right_triangle edge = sorted([int(x) for x in input().split()]) sorted([int(x) for x in input().split()]) edge n = int(input()) int(input()) n
#!/usr/bin/env python3
def right_triangle(edge):
    # a < b < c
    return (edge[0] ** 2 + edge[1] ** 2 == edge[2] ** 2)

n = int(input())
for i in range(n):
    edge = sorted([int(x) for x in input().split()])
    if right_triangle(edge):
        print("YES")
    else:
        print("NO")