#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define int long long
#define vec vector
#define all(m) (m).begin(), (m).end()
#define forn(i,n) for(int i=0;i<(n);i++)

// TIP To <b>Run</b> code, press <shortcut actionId="Run"/> or click the <icon src="AllIcons.Actions.Execute"/> icon in the gutter.
using namespace std;

void add_dig(int a, multiset<int> &s) {
    while (a > 0) {
        s.insert(a % 10);
        a /= 10;
    }
}

int k_dig(int a) {
    int k=0;
    while (a > 0) {
        k++;
        a /= 10;
    }
    return k;
}

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

    if (n != a*b) {
        cout<<"NO\n";
        return;
    }

    if (k_dig(a) != k_dig(b)) {
        cout<<"NO\n";
        return;
    }

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

    multiset<int> dab;
    multiset<int> dn;
    add_dig(a, dab);
    add_dig(b, dab);
    add_dig(n, dn);

    if (dab.size() != dn.size()) {
        cout<<"NO\n";
        return;
    }

    auto it2 = dn.begin();
    for (auto it1 = dab.begin(); it1 != dab.end(); ++it1, ++it2) {
        if (*it1 != *it2) {
            cout<<"NO\n";
            return;
        }
    }
    cout<<"YES\n";
}

signed main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tt = 1;
    cin>>tt;
    while (tt--)
        solve();
    return 0;
}