#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl "\n"

using namespace std;
const int N = 1000000;
int s[N];
void init_set() {                        //初始化
	for (int i = 0; i <= 30; i++)   s[i] = i;
}
int find_set(int x) {                    //查找
	return x == s[x] ? x : find_set(s[x]);
}
void merge_set(int x, int y) {           //合并
	x = find_set(x);   y = find_set(y);
	if (x != y)    s[x] = s[y];          //把x合并到y上，y的根成为x的根
}
void solve()
{
	init_set();
	string s1, s2, s3;
	cin >> s1 >> s2 >> s3;
	if (s1.size() != s2.size())
	{
		cout << "NO" << endl;
		return;
	}
	for (int i = 0; i < s1.size(); i++)
	{
		merge_set(s1[i] - 'a' + 1, s2[i] - 'a' + 1);
	}
	if (s1.size() != s3.size())
	{
		cout << "YES" << endl;
		return;
	}
	for (int i = 0; i < s1.size(); i++)
	{
		if (find_set(s1[i] - 'a' + 1) != find_set(s3[i] - 'a' + 1))
		{
			cout << "YES" << endl;
			return;
		}
	}
	cout << "NO" << endl;
}
int main(void)
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}