#include<bits/stdc++.h>
using namespace std;
using ll = long long;


ll gcd(ll a,ll b){
    if(b) return gcd(b,a%b);
    else return a;
}
void solve(){
    string s;
    cin>>s;
    ll a = 0,b = 0;
    int n = s.size();
    int ni = 0;
    while(s[ni]!='/'){
        a *= 10;
        a += s[ni] - '0';
        ni++;
    }
    for(int i = ni + 1;i<n;i++){
        b *= 10;
        b += s[i] - '0';
    }
    ll na = 1,nb = 1;
    ll now = 0;
    string ans = "";
    ll la = 0;
    ll lb = 1;
    ll ra = 1;
    ll rb = 0;
    while(na!=a||nb!=b){
        //cout<<na<<" "<<nb<<endl;
        int cnt = 0;
        if(nb*a>b*na){
            if(now%2==1) cnt = 0;
            else cnt = 1;
        }else{
            if(now%2==0) cnt = 0;
            else cnt = 1;
        }
        if(cnt==0) ans += "L";
        else ans += "R";
        if(now%2==1) cnt ^= 1;
        now++;

        if(cnt==0) {
            ll bb = nb + lb;
            ll aa = na + la;
            ra = na;
            rb = nb;
            na = aa / gcd(aa,bb);
            nb = bb / gcd(aa,bb);
            //ans += "L";
        }else{
            ll bb = nb + rb;
            ll aa = na + ra;
            la = na;
            lb = nb;
            na = aa / gcd(aa,bb);
            nb = bb / gcd(aa,bb);
           // ans +="R";
        }
    }
    cout<<ans<<endl;

}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}