import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from math import gcd

def same(x,y):
    g=gcd(len(x),len(y))
    s=x[:g]
    for i in range(0,len(x),g):
        if x[i:i+g]!=s:return False
    for i in range(0,len(y),g):
        if y[i:i+g]!=s:return False
    return True

def solve():
    x=SI()
    y=SI()
    m,n=len(x),len(y)
    if same(x,y):
        if len(x)>len(y):
            print("X")
        else:
            print("Y")
    else:
        i=0
        while 1:
            if x[i%m]>y[i%n]:
                print("X")
                break
            if x[i%m]<y[i%n]:
                print("Y")
                break
            i+=1

for _ in range(II()):
    solve()