#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;

ll MOD = 1'000'000'007;

void solve() {
    ll n, a, b;
    cin >> n >> a >> b;

    if (((a % 10) == 0 && (b % 10) == 0) || a*b != n) {
        cout << "NO" << '\n';
        return;
    }

    multiset<ll> set;
    ll cur = n;
    while (cur > 0) {
        set.insert(cur % 10);
        cur /= 10;
    }

    cur = a;
    while (cur > 0) {
        if (set.count(cur % 10) == 0) {
            cout << "NO" << '\n';
            return;
        }
        set.erase(cur % 10);
        cur /= 10;
    }

    cur = b;
    while (cur > 0) {
        if (set.count(cur % 10) == 0) {
            cout << "NO" << '\n';
            return;
        }
        set.erase(cur % 10);
        cur /= 10;
    }

    cout << (set.empty() ? "YES" : "NO") << '\n';
}

signed main() {
    ll tt;
    cin >> tt;
    while(tt--) solve();
}