def load():
    return list(map(int, input().split()))

def sayNo():
    print("NO")

def sayYes():
    print("YES")

def solve():
    n, a, b = map(int, input().split())

    # n natural number with 2k digits
    if len(str(n)) % 2 != 0:
        sayNo()
        return
    # n = a * b
    if n != a * b:
        sayNo()
        return
    
    k = len(str(n)) / 2
    # a and b have k digits
    if len(str(a)) != k or len(str(b)) != k:
        sayNo()
        return

    # both a and b are not divisible by 10 - if both are divisible, then no
    if a % 10 == 0 and b % 10 == 0:
        sayNo()
        return
    # a concat b is permutation of digits n
    sorted_n = sorted(str(n))
    sorted_ab = sorted(str(a) + str(b))
    #print(sorted_n)
    #print(sorted_ab)

    if sorted_n != sorted_ab:
        sayNo()
        return
    sayYes()
    return




def main():
    t = int(input())
    # t = 1
    for i in range(t):
        solve()
if __name__ == "__main__":
    main()