#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define endl "\n"
#define double long double

const int N = 3e5 + 10;
const ll INF = 0x3f3f3f3f3f3f3f;
int p[30];
int find(int x){
  if(x==p[x])return x;
  return p[x]=find(p[x]);
}
ll n, m, k;

void solve()
{
  string a,b,c;
  cin>>a>>b>>c;
  int la=a.size(),lb=b.size(),lc=c.size();
  if(la!=lb){
    cout<<"NO\n";return;
  }
  if(la!=lc){
    cout<<"YES\n";return;
  }
  for(int i=0;i<=26;i++)p[i]=i;
  for(int i=0;i<la;i++){
    int aa=a[i]-'a',bb=b[i]-'a';
    int fa=find(aa),fb=find(bb);
    if(fa!=fb){
      p[fa]=fb;
    }
  }
  for(int i=0;i<la;i++){
    int aa=a[i]-'a',cc=c[i]-'a';
    int fa=find(aa),fc=find(cc);
    if(fa!=fc){
      cout<<"YES\n";return;
    }
  }
  cout<<"NO\n";
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int _ = 1;
  cin >> _;
  while (_--)
    solve();
  return 0;
}