#include <bits/stdc++.h>

using namespace std;
#define ll long long

ll T, n, f[40];
string s1, s2, s3;

int find(int x) {
    while (f[x] != x)
        x = f[x];
    return x;
}

void solve() {
    cin >> s1 >> s2 >> s3;
    n = s1.length();
    if (s1.length() != s2.length()) {
        cout << "NO\n";
        return;
    }
    if (s1.length() != s3.length()) {
        cout << "YES\n";
        return;
    }
    for (int i = 0; i <= 30; i++) f[i] = i;
    for (int i = 0; i < s1.length(); i++) {
        int f2 = find(s2[i] - 'a');
        f[find(s1[i] - 'a')] = f2;
    }
    bool can = false;
    for (int i = 0; i < n; i++) {
        int f1 = find(s1[i] - 'a'), f3 = find(s3[i] - 'a');
        if (f1 != f3) can = true;
    }
    if (can) cout << "YES\n";
    else cout << "NO\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}