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

#define int long long

const int N = 1e6 + 5;

void solve()
{
    string s[3];
    char v[26] = { 0 };
    for (int i = 0; i < 3; i++) {
        cin >> s[i];
    }
    if (s[0].size() != s[1].size()) {
        cout << "NO\n";
        return;
    }
    if (s[0].size() != s[2].size()) {
        cout << "YES\n";
        return;
    }
    int n = s[0].size();
    for (int i = 0; i < n; i++) {
        int c1 = s[0][i] - 'a';
        int c2 = s[1][i] - 'a';
        v[c1] |= (1 << c2) | (1 << c1);
        v[c2] |= (1 << c2) | (1 << c1);
    }
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        int c1 = s[0][i] - 'a';
        int c3 = s[2][i] - 'a';
        cnt += v[c1] == v[c3];
    }
    cout << (cnt == n ? "NO" : "YES") << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

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