#include <bits/stdc++.h>

#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()

using namespace std;

using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

void solve() {
	ll n, a, b;
	string sn, sa, sb;
	cin >> n >> a >> b;
	sn = to_string(n);
	sa = to_string(a);
	sb = to_string(b);

	if (n != a*b) {
		cout << "NO\n";
		return;
	}
	if (!(sa.size() == sb.size() && 2*sb.size() == sn.size())) {
		cout << "NO\n";
		return;
	}
	if (a % 10 == 0 && b % 10 == 0) {
		cout << "NO\n";
		return;
	}
	sa += sb;
	sort(sn.begin(), sn.end());
	sort(sa.begin(), sa.end());
	if (sa != sn) {
		cout << "NO\n";
		return;
	}
	cout << "YES\n";

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	for (int i = 0; i < t; i++)
	solve();
}