#include <bits/stdc++.h>
#pragma GCC optimize(2)

// using namespace std;

using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

void solve() {
    std::string s1, s2, s3;
    std::cin >> s1 >> s2 >> s3;
    std::vector<int> f(26);
    std::iota(f.begin(), f.end(), 0);
    auto find =[&](auto self, int x) -> int{
        if (x != f[x]) f[x] = self(self, f[x]);
        return f[x];
    };
    int n = s1.size();
    int st = 1;
    for(int i = 0; i < n; i++){
        int a = s1[i] - 'a';
        int b = s2[i] - 'a';
        int fa = find(find, a), fb = find(find, b);
        if (fa == fb){
            continue;
        }
        f[fa] = fb;
    }
    for(int i = 0; i < n; i++){
        int a = s1[i] - 'a';
        int b = s3[i] - 'a';
        int fa = find(find, a), fb = find(find, b);
        if (fa == fb){
            st = 0;
            break;
        }
    }
    std::cout << (st ? "YES" : "NO") << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    // std::cout << std::fixed << std::setprecision(10); // 固定输出精度
    int t = 1;
    std::cin >> t;

    while (t--) {
        solve();
    }
    

    return 0;
}