#include <bits/stdc++.h>
using namespace std;

bool is_good(const string& s) {
    return s.find("good") != string::npos;
}

bool greedy_transform(string S, const string& T) {
    int n = (int)S.size();

    for (int i = 0; i < n; i++) {
        if (S[i] == T[i]) continue;

        int best = -1;
        for (int j = i + 1; j < n; j++) {
            if (S[j] == T[i]) {
                best = j;
                break;
            }
        }

        if (best == -1) return false;

        while (best > i) {
            string U = S;
            swap(U[best - 1], U[best]);

            if (is_good(U)) return false;

            S = U;
            best--;
        }
    }

    return S == T;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int Q;
    cin >> Q;

    while (Q--) {
        string S, T;
        cin >> S >> T;

        vector<int> cntS(3, 0), cntT(3, 0);
        for (char c : S) {
            if (c == 'd') cntS[0]++;
            else if (c == 'o') cntS[1]++;
            else cntS[2]++;
        }
        for (char c : T) {
            if (c == 'd') cntT[0]++;
            else if (c == 'o') cntT[1]++;
            else cntT[2]++;
        }

        if (cntS != cntT) {
            cout << "No\n";
            continue;
        }

        bool ok1 = greedy_transform(S, T);
        bool ok2 = greedy_transform(T, S);

        cout << ((ok1 || ok2) ? "Yes" : "No") << '\n';
    }

    return 0;
}