#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;

#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 18;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-9;
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<n;i++)
#define Se second
#define Fi first

int main() {
	while (1) {
		int n; ll i, j;
		scanf("%d%lld%lld", &n, &i, &j);
		if (n == 0 && i == 0 && j == 0) break;
		vector <int> f;
		ll mi = i;
		for (int m = n; m; m--) {
			if (mi <= 1LL << (m - 1)) f.push_back(1), mi = (1LL << (m - 1)) + 1 - mi;
			else f.push_back(0), mi = mi - (1LL << (m - 1));
		}
		reverse(all(f));
		int m = n;
		for (int e : f) {
			if (e == 1) {
				if (j <= 1LL << (m - 1)) putchar('L'), j = (1LL << (m - 1)) + 1 - j;
				else putchar('R'), j = (1LL << m) + 1 - j;
			}
			else {
				if (j <= 1LL << (m - 1)) putchar('R');
				else putchar('L'), j = j - (1LL << (m - 1));
			}
			--m;
		}
		puts("");
	}
	return 0;
}