#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f

const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;

void solve()
{
    string s1, s2, s3;
    cin >> s1 >> s2 >> s3;
    map<int, int> mp;
    if (s1.size() != s2.size())
    {
        cout << "NO" << endl;
        return;
    }
    if (s1.size() != s3.size())
    {
        cout << "YES" << endl;
        return;
    }
    int n = s1.size();
    int cnt = 1;
    for (int i = 0; i < n; i++)
    {
        mp[s1[i]] = mp[s2[i]] = ++cnt;
    }
    for (int i = 0; i < n; i++)
    {
        if (!mp[s3[i]] || mp[s3[i]] != mp[s1[i]])
        {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}