//Think twice,code once.
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define INF 0x3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define ff first
#define ss second
#define pii pair<int,int>
#define mem(i,n) memset(i,n,sizeof i)
#define dg(a) std::cout << #a << " = " << a << endl
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

void solve()
{
    string s1,s2,s3;
    cin >> s1 >> s2 >> s3;
    int n=s1.size();
    if(s2.size()!=n)
    {
        cout << "NO" << endl;
        return;
    }
    if(s3.size()!=n)
    {
        cout << "YES" << endl;
        return;
    }
    for(int i=0;i<n;i++)
    {
        if(s3[i]!=s1[i]&&s3[i]!=s2[i])
        {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}

int32_t main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while(t--) solve();
    return 0;
}