#include <bits/stdc++.h>
#include <math.h>
			
using namespace std;

// c++ short types
#define Int long long
#define vt vector

void solver() {
	int a, b; char c;
	cin >> a >> c >> b;
	// (a, b, h+1, id) -> (p_a, p_b, h, prev_id)
	// if from left: id = prev_id + 2 ^ h
	// if from right:id = prev_id + 2 * 2 ^ h
	vt<int> is_left, bits ;
	auto Rec = [&](auto self, int a, int b) -> void {
		if(a == b) {
			return ;
		}
		if(a < b) {
			// 1 / (x+1) = a / b
			// x + 1 = b / a
			// x = (b-a)/a
			is_left.push_back(1);
			self(self, b-a, a);
			bits.push_back(1);
		} else {
			// 1/x + 1 = a/b
			// 1/x = (a-b)/b
			is_left.push_back(0);
			self(self, b, a-b);
			bits.push_back(2);
		}
	};
	Rec(Rec, a, b);
	bits[0] ++ ;
	for(int i = 0; i < bits.size(); ++i) {
		int cnt = bits[i] / 2;
		if(cnt) {
			if(i == bits.size()-1) {
				bits.push_back(0);
			}
			bits[i+1] += cnt;
		}
		bits[i] %= 2;
	}
	bits.pop_back();
	string res;
	for(int x: bits) {
		res += "LR"[x];
	}
	reverse(res.begin(), res.end());
	cout << res << "\n";
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int tt = 1;
	cin >> tt;
	for(int t = 0; t < tt; ++t) {
    solver();
	}
	return 0;
}