import sys

t = int(input())



def get_digits(n):
    if(n == 0):
        return [0]

    if(n==1):
        return [1]

    digits = []

    while (n!=0):
        d = n%10
        digits.append(d)
        n //= 10

    return(list(reversed(digits)))


def check_permutation(max_bat,a,b):
    mb_d = get_digits(max_bat)
    a_d = get_digits(a)
    b_d = get_digits(b)

    concat = (list(map(str,a_d)) + list(map(str,b_d))) 

    for c in list(map(str,mb_d)):
        c_found = False
        for i,digit in enumerate(concat):
            if c==digit:
                concat[i] = ' '
                c_found = True
                break
        
        if c_found == False:
            return False
        
    return True

"""
print(check_permutation(1260,21,60))
print(check_permutation(1260,21,0))
print(check_permutation(1261, 12, 61))
print(check_permutation(1111,11,11)) 
"""

for i in range(t):
    line = sys.stdin.readline().rstrip('\n')
    
    bats_str = line.split()
    
    bats_int = list(map(int,line.split()))

    max_bat = max(bats_int)
    small_bats = list(set(bats_int)-set([max_bat]))

    max_bat = bats_int[0] 
    a = bats_int[1] #small_bats[0] 
    b = bats_int[2] #small_bats[1]

    #print(f"{a=}{b=}{max_bat=}")

    if(a*b != max_bat):
        print("NO")
        continue
    
    two_k_digits = len(get_digits(max_bat))
    if(two_k_digits % 2 != 0):
        print("NO")
        continue

    if(len(get_digits(a)) != (two_k_digits//2) or len(get_digits(b)) != (two_k_digits//2)):
        print("NO")
        continue

    if(a%10 == 0 and b%10 == 0):
        print("NO")
        continue

    if(not check_permutation(max_bat,a,b)):
       print("NO")
       continue

    print("YES")