#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
  int t;
  cin >> t;
  while(t--) {
    string x, y;
    cin >> x >> y;
    int mini = min(x.size(), y.size());
    int maxi = max(x.size(), y.size());
    bool ok = false;
    for(int i = 0; i < mini; i++) {
      if(x[i] < y[i]) {
        cout << "Y" << endl;
        ok = true;
        break;
      }
      if(x[i] > y[i]) {
        cout << "X" << endl;
        ok = true;
        break;
      }
    }
    if(ok) {
      continue;
    }
    int cnt = 0;
    string tmpX = x, tmpY = y;
    while(tmpX.size() < maxi * 2) {
      tmpX.push_back(x[cnt % x.size()]);
      cnt++;
    }
    cnt = 0;
    while(tmpY.size() < maxi * 2) {
      tmpY.push_back(y[cnt % y.size()]);
      cnt++;
    }
    for(int i = 0; i < maxi * 2; i++) {
      if(tmpX[i] < tmpY[i]) {
        cout << "Y" << endl;
        ok = true;
        break;
      }
      if(tmpX[i] > tmpY[i]) {
        cout << "X" << endl;
        ok = true;
        break;
      }
    }
    if(ok) {
      continue;
    }
    if(x.size() < y.size()) {
      cout << "Y" << endl;
    } else {
      cout << "X" << endl;
    }
  }
  return 0;
}