#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
//using mint = modint1000000007;
//using mint = modint998244353;

void solve(){
  string x, y;
  cin >> x;
  cin >> y;

  rep(i,2*max(x.size(),y.size())){
    if(x[i%x.size()] < y[i%y.size()]){
      cout << "Y" << endl;
      return;
    }
    if(x[i%x.size()] > y[i%y.size()]){
      cout << "X" << endl;
      return;
    }
  }

  if(x.size() > y.size()){
    cout << "X" << endl;
  }else{
    cout << "Y" << endl;
  }
}

int main(){
  int T;
  cin >> T;
  rep(t,T){
    solve();
  }
  
  return 0;
}