#include <bits/stdc++.h>
using namespace std;

using LL = long long;

void solve() {
    string a, b, c;
    cin >> a >> b >> c;

    if (a.size() != b.size()) {
        cout << "NO\n";
        return;
    }

    if (b == c) {
        cout << "NO\n";
        return;
    }

    if (a.size() != c.size()) {
        cout << "YES\n";
        return;
    }

    int n = a.size();
    set<int> p[26];

    for (int i = 0; i < n; i++) {
        char x = a[i], y = b[i];
        p[x - 'a'].emplace(y - 'a');
        p[y - 'a'].emplace(x - 'a');
    }

    for (int i = 0; i < n ;i++) {
        int x = a[i] - 'a', y = c[i] - 'a';
        if (x == y) continue;
        if (p[x].contains(y)) {
            continue;
        }
        cout << "YES\n";
        return;
    }

    cout << "NO\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

/*
4
abab
cdcd
abce
abab
cdcd
abcd
abab
cdcd
abc
x
yz
def
*/