#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fo(i, n) rep(i, 0, n)
#define all(x) std::begin(x), std::end(x)
#define sz(x) int((x).size())
#define F first
#define S second
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.badbit | cin.failbit);

    ll tt;
    cin >> tt;
    while(tt--){
        ll n, a, b;
        cin >> n >> a >> b;
        if(a * b != n){
            cout << "NO" << '\n';
            continue;
        }
        if((a % 10) == 0 && (b % 10) == 0){
            cout << "NO" << '\n';
            continue;
        }

        ll dN = 0, dA = 0, dB = 0;

        vi cnt(10, 0), cnt2(10, 0);
        while(n > 0){
            ll c = n % 10;
            n /= 10;
            dN++;
            cnt[c]++;
        }

        while(a > 0){
            ll c = a % 10;
            a /= 10;
            dA++;
            cnt2[c]++;
        }

        while(b > 0){
            ll c = b % 10;
            b /= 10;
            dB++;
            cnt2[c]++;
        }

        ll k = dN / 2;
        if((dA != k) || (dB != k)){
            cout << "NO" << '\n'; continue;
        }
        bool ok = true;
        for(int i = 0; i < cnt.size(); i++){
            if(cnt[i] != cnt2[i]){
                ok = false;
            }
        }
        if(ok){
            cout << "YES" << '\n';
        }else{
            cout << "NO" << '\n';
        }
    }
}