Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   a,b,c = map(int,input().split(" "))
   p = [a,b,c]
   p.sort()
   if pow(p[0],2)+pow(p[1],2)==pow[p[2],2]
   print("YES")
   else
   print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   a,b,c = map(int,input().split(" "))
   p = [a,b,c]
   p.sort()
   if pow(p[0],2)+pow(p[1],2)==pow[p[2],2]:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   p = list(map(int,input().split(" ")))
   p.sort()
   if p[0]**2 + p[1]**2== p[2]**2:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   a,b,c = sort(list(map(int,input().split(" "))))
  
   if a**2 + b**2== c**2:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   a,b,c = sorted(list(map(int,input().split())))
  
   if a**2 + b**2== c**2:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
for i in range(N) :
   p = list(map(int,input().split()))
   p.sort()
   if p[0]*p[0] + p[1]*p[1] == p[2]*p[2]:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
n = int(input()) 
for i in range(n):
   p = list(map(int,input().split()))
   p.sort()
   if p[0]*p[0] + p[1]*p[1] == p[2]*p[2]:
     print("YES")
   else
     print("NO")


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(n):
    p=list(map(int,input().split()))
    p.sort()
    a=x[0]
    b=x[1]
    c=x[2]
    if a*a+b*b==c*c:
        print('YES')
    else:
        print('NO')


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [a,b,c]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')


Fixed submission:
n=int(input())
for i in range(n):
    a,b,c = input().split()
    x = int(a)
    y = int(b)
    z = int(c)
    p = [x,y,z]
    p.sort()
    if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
        print('YES')
    else:
        print('NO')