#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <numeric>
#include <array>
#include <tuple>
#include <cassert>
#include <random>
#include <chrono>
#define int long long

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using PII = std::pair<int, int>;

//std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};
constexpr int N = 2e5 + 10;

void solve() {
    std::string s1, s2, s3;
    std::cin >> s1 >> s2 >> s3;

    if (s1.size() != s2.size()) {
        std::cout << "NO\n";
        return;
    } 
    if (s1.size() != s3.size()) {
        std::cout << "YES\n";
        return;
    }
    for (int i = 0; i < s3.size(); i ++) {
        if (s3[i] != s1[i] && s3[i] != s2[i]) {
            std::cout << "YES\n";
            return;
        }
    }
    std::cout << "NO\n";
    return;
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int T = 1;
    std::cin >> T;
    while (T --) {
        solve();
    }
    return 0;
}