Q = int(input())

for _ in range(Q):
    S = input()
    T = input()

    cntS = [0, 0, 0]  # d, o, g
    cntT = [0, 0, 0]

    for c in S:
        if c == 'd':
            cntS[0] += 1
        elif c == 'o':
            cntS[1] += 1
        else:
            cntS[2] += 1

    for c in T:
        if c == 'd':
            cntT[0] += 1
        elif c == 'o':
            cntT[1] += 1
        else:
            cntT[2] += 1

    if cntS != cntT:
        print("No")
        continue

    wallS = False
    wallT = False

    for idx, X in enumerate([S, T]):
        hasG = False
        hasD = False
        seenD = False
        orderOK = True

        for c in X:
            if c == 'o':
                continue

            if c == 'd':
                hasD = True
                seenD = True
            else:
                hasG = True
                if seenD:
                    orderOK = False

        wall = False

        if hasG and hasD and orderOK:
            lastG = -1
            firstD = len(X)

            for i in range(len(X)):
                if X[i] == 'g':
                    lastG = i
                if X[i] == 'd':
                    firstD = i
                    break

            betweenO = 0
            for i in range(lastG + 1, firstD):
                if X[i] == 'o':
                    betweenO += 1

            wall = betweenO >= 3

        if idx == 0:
            wallS = wall
        else:
            wallT = wall

    if wallS == wallT:
        print("Yes")
    else:
        print("No")