#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

const int MAX=1000000;

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

    bool overlap=true;
    {
        string cX=x,cY=y;
        if(cX.size()>cY.size()){
            swap(cX,cY);
        }
        //cX<=cY
        if(cY.size()%cX.size()==0){
            for(int i=0;i<cY.size();i++){
                if(cY[i]!=cX[i%cX.size()]){
                    overlap=false;
                    break;
                }
            }
        }else{
            overlap=false;
        }
    }
    if(overlap){
        if(x.size()>y.size()){
            return 'X';
        }else{
            return 'Y';
        }
    }

    int lenx=x.size();
    int leny=y.size();
    for(int i=0;i<MAX;i++){
        if(x[i%lenx]!=y[i%leny]){
            if(x[i%lenx]>y[i%leny]){
                return 'X';
            }else{
                return 'Y';
            }
        }
    }
    return 'X';

}

int main(){
    int T;
    cin>>T;
    vector<char> ans(T);
    for(int t=0;t<T;t++){
        ans[t]=solve();
    }

    for(int t=0;t<T;t++){
        cout<<ans[t]<<endl;
    }

}