//Start: 2024-11-14 18:34:15
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt, __func__, __LINE__, ##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=1e5+5;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
ll a,b;bool ans[N];int tot;
void solve(int la,int lb,int A,int B,int ra,int rb){
  if(A==a&&b==B) return;
  if(a*B<=b*A) ans[++tot]=0,solve(la,lb,la+A,lb+B,A,B);
  else ans[++tot]=1,solve(A,B,A+ra,B+rb,ra,rb);
}
void ljy(){
  a=read(),b=read();
  tot=0;solve(0,1,1,1,1,0);
  for(int i=2;i<=tot;i+=2) ans[i]=ans[i]^1;
  For(i,1,tot) putchar(ans[i]?'R':'L');puts("");
}
signed LJY(){int T=read();while(T--) ljy();}