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


int main() {
    int Q;
    cin >> Q;

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

        vector<int> cntS(3, 0), cntT(3, 0); // d, o, g

        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 wallS = false, wallT = false;

        for (int id = 0; id < 2; id++) {
            string X = (id == 0 ? S : T);

            bool hasG = false, hasD = false;
            bool seenD = false;
            bool orderOK = true;

            for (char c : X) {
                if (c == 'o') continue;

                if (c == 'd') {
                    hasD = true;
                    seenD = true;
                } else { // c == 'g'
                    hasG = true;
                    if (seenD) orderOK = false;
                }
            }

            bool wall = false;

            if (hasG && hasD && orderOK) {
                int lastG = -1;
                int firstD = (int)X.size();

                for (int i = 0; i < (int)X.size(); i++) {
                    if (X[i] == 'g') lastG = i;
                    if (X[i] == 'd') {
                        firstD = i;
                        break;
                    }
                }

                int betweenO = 0;
                for (int i = lastG + 1; i < firstD; i++) {
                    if (X[i] == 'o') betweenO++;
                }

                wall = (betweenO >= 3);
            }

            if (id == 0) wallS = wall;
            else wallT = wall;
        }

        cout << (wallS == wallT ? "Yes" : "No") << '\n';
    }

    return 0;
}