import java.util.HashMap;
import java.util.Scanner;
import java.math.*;

public class Vampires {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int testCases = sc.nextInt();

        for (int i = 0; i < testCases; i++) {
            long max = sc.nextLong();
            long middle = sc.nextLong();
            long min = sc.nextLong();

            if (max == min * middle && String.valueOf(middle).length() == String.valueOf(min).length() && !(min % 10 == 0 && middle % 10 == 0)) {
                HashMap<Character, Integer> maxMap = new HashMap<>();
                String text = String.valueOf(max);
                for (char character : text.toCharArray()) {
                    if (maxMap.containsKey(character)) {
                        maxMap.replace(character, maxMap.get(character) + 1);
                    } else {
                        maxMap.put(character, 1);
                    }
                }
                text = String.valueOf(min) + String.valueOf(middle);
                HashMap<Character, Integer> maxMap2 = new HashMap<>();
                for (char character : text.toCharArray()) {
                    if (maxMap2.containsKey(character)) {
                        maxMap2.replace(character, maxMap2.get(character) + 1);
                    } else {
                        maxMap2.put(character, 1);
                    }
                }
                if (maxMap2.equals(maxMap)) {
                    System.out.println("YES");
                } else {
                    System.out.println("NO");
                }
            } else {
                System.out.println("NO");
            }
        }
    }
}