#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

struct disjoint_set_union {
    int components;
    std::vector<int> f;

    disjoint_set_union(int n = 0) : components(n), f(n, -1) {}

    int size() const {
        return f.size();
    }

    // Resets everything.
    void set_default() {
        components = size();
        std::fill(f.begin(), f.end(), -1);
    }

    int root(int v) {
        return f[v] < 0 ? v : f[v] = root(f[v]);
    }

    // Returns true if v and u were in different components.
    bool unite(int v, int u) {
        v = root(v), u = root(u);
        if (v == u)
            return false;

        if (f[v] > f[u])
            std::swap(v, u);

        f[v] += f[u];
        f[u] = v;
        components--;
        return true;
    }

    // Returns true if v and u are in the same set.
    bool connected(int v, int u) {
        return root(v) == root(u);
    }

    // Returns the size of the set with v.
    int component_size(int v) {
        return -f[root(v)];
    }
};


void solve() {
    string s1, s2, s3; cin >> s1 >> s2 >> s3;
    if (s1.size() != s2.size()) {
        cout << "NO\n";
        return;
    }
    disjoint_set_union dsu(26);
    rep(i, s1.size()) {
        dsu.unite(s1[i] - 'a', s2[i] - 'a');
    }
    auto enc = [&] (string s) {
        string t;
        for(auto c : s) {
            t += char('a' + dsu.root(c - 'a'));
        }
        return t;
    };
    s1 = enc(s1);
    s2 = enc(s2);
    s3 = enc(s3);
    assert(s1 == s2);
    if (s1 == s3) {
        cout << "NO\n";
    } else {
        cout << "YES\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;

    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}