#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define For(i, a, n) for(ll i=a;i<n;i++)
#define vec vector
#define sz(x) (ll)x.size()
#define all(x) begin(x), end(x)


template<typename... Args>
void dbg(Args&&... args){
    ((cerr<<args<<" |"),...);
    cerr<<endl;
}

void solve(){
    ll n, a, b;cin>>n>>a>>b;
    string sn = to_string(n), sa = to_string(a), sb = to_string(b);
    ll k = sn.size();
    if(n!= a*b || k%2 || sz(sa)!=k/2 || sz(sb)!=k/2){
        cout<<"NO\n";return;
    }
    if(a%10==0 && b%10==0){
        cout<<"NO\n";return;
    }
    sort(all(sn));
    string c = sa + sb;
    sort(all(c));
    if(sn!=c){
        cout<<"NO\n";return;
    }    
    cout<<"YES\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    ll t = 1;cin>>t;
    while(t--)solve();
}