#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;
#define endl '\n'
#define x first
#define y second
const int N = 2e5 + 10;
const LL INF = 1e18, mod = 1e9 + 7;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

string s1, s2, s3;
int f[27];

void init(){
    for(int i = 0; i < 26; i ++) f[i] = i;
}

int find(int a){
    if(a == f[a]) return a;
    else return f[a] = find(f[a]);
}

void merge(int a, int b){
    int fa = find(a), fb = find(b);
    if(fa == fb) return;
    if(fa != fb) f[fb] = fa;
}

void Lonelyper(){
    init();
    cin >> s1 >> s2 >> s3;
    if(s1.size() != s2.size()){
        cout << "NO" << endl;
        return;
    }
    if(s1.size() != s3.size()){
        cout << "YES" << endl;
        return;
    }
    int n = s1.size();
    for(int i = 0; i < n; i ++){
        if(s1[i] != s2[i]){
            merge(s1[i] - 'a', s2[i] - 'a');
        }
    }
    for(int i = 0; i < n; i ++) s1[i] = find(f[s1[i] - 'a']) + 'a';
    n = s2.size();
    for(int i = 0; i < n; i ++) s2[i] = find(f[s2[i] - 'a']) + 'a';
    n = s3.size();
    for(int i = 0; i < n; i ++) s3[i] = find(f[s3[i] - 'a']) + 'a';
    // cout << s1 << endl << s2 << endl << s3 << endl;
    if(s1 == s2 && s1 != s3){
        cout << "YES" << endl;
    }
    else{
        cout << "NO" << endl;
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --) {
        Lonelyper();
    }
    return 0;
}