#include<bits/stdc++.h>

using namespace std;   

#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define sz(a) int((a).size())

typedef long long li;

string a, b, c;

bool read() {
	if (!(cin >> a >> b >> c))
		return false;
	return true;
}

const int AL = 26;

vector<int> rk, p;

int getp(int a){
	return a == p[a] ? a : p[a] = getp(p[a]);
}

void unite(int a, int b){
	a = getp(a), b = getp(b);
	if (a == b) return;
	if (rk[a] < rk[b]) swap(a, b);
	rk[a] += rk[b];
	p[b] = a;
}

void solve() {
	rk.assign(AL, 1);
	p.resize(AL);
	iota(p.begin(), p.end(), 0);
	if (sz(a) != sz(b)){
		cout << "NO\n";
		return;
	}
	forn(i, sz(a)) unite(a[i] - 'a', b[i] - 'a');
	if (sz(a) != sz(c)){
		cout << "YES\n";
		return;
	}
	forn(i, sz(a)) if (getp(a[i] - 'a') != getp(c[i] - 'a')){
		cout << "YES\n";
		return;
	}
	cout << "NO\n";
}

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	cin >> t;
	forn(i, t) {
	 	read();
		solve();
	}
}