#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


namespace po167{
//LCP vec[0,n) and vec[i,n)
//for all i 
//O(vec.size())
template<class T>
std::vector<int> Z_algo(std::vector<T> &vec){
	int n=vec.size();
	int ind=1,j=0,k;
	std::vector<int> ans(n,0);
	ans[0]=n;
	while(ind<n){
		while(ind+j<n&&vec[j]==vec[ind+j]) j++;
		ans[ind]=j;
		if(j==0){
			ind++;
			continue;
		}
		k=1;
		while(k+ind<n&&ans[k]+k<j){
			ans[k+ind]=ans[k];
			k++;
		}
		j-=k;
		ind+=k;
	}
	return ans;
}
std::vector<int> Z_algo(std::string &vec){
	int n=vec.size();
	int ind=1,j=0,k;
	std::vector<int> ans(n,0);
	ans[0]=n;
	while(ind<n){
		while(ind+j<n&&vec[j]==vec[ind+j]) j++;
		ans[ind]=j;
		if(j==0){
			ind++;
			continue;
		}
		k=1;
		while(k+ind<n&&ans[k]+k<j){
			ans[k+ind]=ans[k];
			k++;
		}
		j-=k;
		ind+=k;
	}
	return ans;
}
}
using po167::Z_algo;
void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,t) solve();
}

void solve(){
	string S,T;
	cin>>S>>T;

	string U=S+'#'+T;
	string V=T+'#'+S;
	int N=S.size(),M=T.size();
	vector<int> seen(N+M);
	int ind=0;
	auto Z_u=Z_algo(U);
	auto Z_v=Z_algo(V);
	int l=0,r=0;
	while(seen[ind]==0){
		//if(T=="xyzxyz") cout<<l<<" "<<r<<" "<<ind<<"\n";
		if(ind<N){
			int tmp=Z_v[M+1+l];
			//cout<<tmp<<"\n";
			l+=tmp;
			r+=tmp;
			if(tmp==min(M,N-ind)){
				l%=N;
				r%=M;
			}else{
				break;
			}
		}else{
			int tmp=Z_u[N+r+1];
			//cout<<tmp<<"\n";
			l+=tmp;
			r+=tmp;
			if(tmp==min(N,M+N-ind)){
				l%=N;
				r%=M;
			}else{
				break;
			}
		}
		seen[ind]=1;
		if(r==0) ind=l;
		else ind=r+N;
		// /cout<<"ok\n";
	}
	bool ans;
	if(seen[ind]==1){
		//cout<<S<<" "<<T<<"\n";
		ans=(S.size()>T.size());
	}else{
		ans=(S[l]>T[r]);
	}
	if(ans) cout<<"X\n";
	else cout<<"Y\n";
	/*vec_out(Z_u);
	vec_out(Z_v);
	cout<<U<<"\n"<<V<<"\n";*/
}