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

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

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

    int Q;
    cin >> Q;

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

        queue<string> que;
        set<string> seen;

        que.push(S);
        seen.insert(S);

        bool ok = false;

        while (!que.empty()) {
            string cur = que.front();
            que.pop();

            if (cur == T) {
                ok = true;
                break;
            }

            int n = (int)cur.size();

            for (int i = 0; i + 1 < n; i++) {
                string nxt = cur;
                swap(nxt[i], nxt[i + 1]);

                if (is_good_string(nxt)) continue;
                if (seen.count(nxt)) continue;

                seen.insert(nxt);
                que.push(nxt);
            }
        }

        cout << (ok ? "Yes" : "No") << '\n';
    }

    return 0;
}