#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int k;
    cin >> k;
 
    while (k--) {
        int D, i;
        cin >> D >> i;
 
 
        if (i < 1 || i >= (1 << D)) {
            cout << "False" << endl;
            continue;
        }
 
 
        cout << "True" << endl;
        vector<char> path;
 
        int node = i; 
        while (node > 1) {
            if (node % 2 == 0) {
                path.push_back('L');
            } else {
                path.push_back('R');
            }
            node /= 2; 
        }
 
 
        reverse(path.begin(), path.end());
        for (char c : path) {
            cout << c;
        }
        cout << endl;
    }
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGludCBrOwogICAgY2luID4+IGs7CgogICAgd2hpbGUgKGstLSkgewogICAgICAgIGludCBELCBpOwogICAgICAgIGNpbiA+PiBEID4+IGk7CgogICAKICAgICAgICBpZiAoaSA8IDEgfHwgaSA+PSAoMSA8PCBEKSkgewogICAgICAgICAgICBjb3V0IDw8ICJGYWxzZSIgPDwgZW5kbDsKICAgICAgICAgICAgY29udGludWU7CiAgICAgICAgfQoKICAgICAKICAgICAgICBjb3V0IDw8ICJUcnVlIiA8PCBlbmRsOwogICAgICAgIHZlY3RvcjxjaGFyPiBwYXRoOwoKICAgICAgICBpbnQgbm9kZSA9IGk7IAogICAgICAgIHdoaWxlIChub2RlID4gMSkgewogICAgICAgICAgICBpZiAobm9kZSAlIDIgPT0gMCkgewogICAgICAgICAgICAgICAgcGF0aC5wdXNoX2JhY2soJ0wnKTsKICAgICAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgICAgIHBhdGgucHVzaF9iYWNrKCdSJyk7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgbm9kZSAvPSAyOyAKICAgICAgICB9CgogICAgICAgIAogICAgICAgIHJldmVyc2UocGF0aC5iZWdpbigpLCBwYXRoLmVuZCgpKTsKICAgICAgICBmb3IgKGNoYXIgYyA6IHBhdGgpIHsKICAgICAgICAgICAgY291dCA8PCBjOwogICAgICAgIH0KICAgICAgICBjb3V0IDw8IGVuZGw7CiAgICB9Cn0=

NQo0IDIKMyA0CjEwIDEKMiAyCjggMTI4

5
4 2
3 4
10 1
2 2
8 128