#include <iostream>
#include <cassert>
using namespace std;

void solve() {
    string a, b, c;
    cin >> a >> b >> c;
    int cat[26], cnt = 0;
    for (int i = 0; i < 26; ++i) cat[i] = -1;
    if (a.length() != b.length()) {
        cout << "NO\n";
        return;
    }
    if (a.length() != c.length()) {
        cout << "YES\n";
        return;
    }
    int n = a.length();
    for (int i = 0; i < n; ++i) {
        int aa = a[i] - 'a';
        int bb = b[i] - 'a';
        if (cat[aa] == -1 && cat[bb] == -1) {
            cat[aa] = cat[bb] = cnt++;
        } else if (cat[aa] == -1) {
            cat[aa] = cat[bb];
        } else if (cat[bb] == -1) {
            cat[bb] = cat[aa];
        } else {
            assert(cat[bb] == cat[aa]);
        }
    }

    for (int i = 0; i < n; ++i) {
        int aa = a[i] - 'a';
        int cc = c[i] - 'a';
        if (cat[aa] != cat[cc]) {
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T; cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}