#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

ll n,t,p;

void solve(){
    vector<ll> rnk(n+1); // rnk[i] := i回おった後
    rnk[n] = t-1;
    ll th = (1LL << n);
    for(int i=n-1;i>=0;i--){
        if(rnk[i+1] <  th/2){
            rnk[i] = th/2 - 1 - rnk[i+1];
        }else{
            rnk[i] = rnk[i+1] - th/2;
        }
        th >>= 1;
    }

    ll pos = p-1;
    th = 1;
    ll len = (1LL<<n);
    string ans = "";
    for(int i=0;i<n;i++){ // rnk[i] -> rnk[i+1]
        if(pos < len/2){ // left
            // L : rnk[i] -> th - rnk[i] - 1
            if(rnk[i+1] == th - rnk[i] - 1 ){
                ans.push_back('L');
                pos = (len/2) - pos - 1;
            }else if(rnk[i+1] == rnk[i] + th){
                ans.push_back('R');
            }else{
                assert(false);
            }
        }else{
            // R : rnk[i] -> th - rnk[i] - 1
            if(rnk[i+1] == th-rnk[i]-1){
                ans.push_back('R');
                pos = len - 1 - pos;
            }else if(rnk[i+1] == rnk[i] + th){
                ans.push_back('L');
                pos -= len / 2;
            }else{
                assert(false);
            }
        }
        len >>= 1;
        th <<= 1;
    }
    cout << ans << endl;
}

int main(){
    while(cin >> n >> t >> p)
    {
        if(!n and !t and !p){
            break;
        }
        solve();
    }
}



Measured memory_bytes: 3164