def string_to_charmap(n):
    charmap = {}
    for c in n:
        if c in charmap.keys():
            charmap[c] += 1
        else:
            charmap[c] = 1
    return charmap

def is_permutation(n, a, b):
    occurences = string_to_charmap(n)
    for c in a + b:
        if not c in occurences.keys():
            return False
        occurences[c] -= 1
    for o in occurences.values():
        if o != 0:
            return False
    return True

t = int(input())
for i in range(t):
    n, a, b = input().split(' ')
    if len(a) != len(b):
        print("NO")
        continue
    if a[-1] == "0" and b[-1] == "0":
        print("NO")
        continue
    if not is_permutation(n, a, b):
        print("NO")
        continue
    if not int(n) == int(a) * int(b):
        print("NO")
        continue
    print("YES")