#include <iostream>
#include <bits/stdc++.h>

#define ll long long
using namespace std;

void swap(ll&a, ll&b){
    ll tmp;
    tmp = a;
    a = b;
    b = tmp;
}

pair<map<int, ll>, ll> make_map(ll n, map<int,ll>& nmap){
    ll n_digits = 0;
    while (n){
        int digit = n %10;
        n = n/10;
        if(nmap.count(digit) > 0){
            nmap[digit]++;
        }else{
            nmap[digit] = 1;
        }
        n_digits++;
    }
    return make_pair(nmap, n_digits);
}

bool solve(){
    ll a,b,n;
    cin >> n;
    cin >> a;
    cin >> b;
    if( n < a || n < b){
        return false;
    }

    if (a*b != n){
        return false;
    }
    if(a%10 == 0 && b%10 == 0){
        return false;
    }
    map<int,ll> asdf;
    auto nmap = make_map(n, asdf);

    map<int,ll> fdsa;
    auto amap = make_map(a, fdsa);
    if(amap.second *2 != nmap.second){
        return false;
    }
    auto abmap = make_map(b, amap.first);

    if (nmap.first != abmap.first){
        return false;
    }

    return true;
}


int main() {
    std::cout << "Hello, World!" << std::endl;
    int t;
    cin >> t;
    for (int i = 0; i < t; i++){
        if(solve()){
            cout << "YES" << endl;
        }else{
            cout << "NO" << endl;
        }
    };
    return 0;
}