// Problem: A. AUS
// Contest: Codeforces - 2024 Hangzhou
// URL: https://codeforces.com/gym/554472/problem/A
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
// #define int ll
//#define N
using namespace std;
const int N=1005;
int fa[N];
inline int gf(int x)
{
	while (x!=fa[x]) x=fa[x]=fa[fa[x]];
	return x;
}
void merge(int x,int y)
{
	x=gf(x),y=gf(y);
	fa[x]=y;
}
void BellaKira()
{
	string s,ss,sss;
	cin>>s>>ss>>sss;
	if (sz(s)!=sz(ss))
		cout<<"NO\n";
	else
	if (sz(s)==sz(ss) && sz(s)!=sz(sss))
	{
		cout<<"YES\n";
	} else
	{
		for (int i=0;i<26;i++) fa[i]=i;
		for (int i=0;i<sz(s);i++)
			merge(s[i]-'a',ss[i]-'a');
		int bl=0;
		// cout<<gf('e'-'a')<<" "<<gf('b'-'a')<<endl;
		for (int i=0;i<sz(s);i++)
			if (gf(s[i]-'a')!=gf(sss[i]-'a'))
			{
				bl=1;
				break;
			}
		if (bl) cout<<"YES\n";
		else cout<<"NO\n";
	}
		
			
			
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	cin>>T;
	while (T--)
	{
		BellaKira();
	}
}