#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

bool chmin(auto &a, auto b) {
    if(a <= b) return false;
    a = b;
    return true;
}

bool chmax(auto &a, auto b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void solve(){
    int n, m; cin >> n >> m;
    vector<set<int>> g(n);
    rep(i,0,m){
        int u, v; cin >> u >> v;
        g[u].insert(v);
        g[v].insert(u);
    }
    auto deg = [&](int v){
        return g[v].size();
    };
    vector<int> ans(n,0);
    auto dfs = [&](auto sfs, vector<int> del) -> void {
        vector<int> deg2;
        vector<int> ops;
        for (int v : del){
            // deg(v) == 2
            int op = -1;
            for (int u : g[v]){
                g[u].erase(v);
                if (deg(u) == 2){
                    deg2.emplace_back(u);
                    op = u;
                }
            }
            ops.emplace_back(op);
        }
        if (deg2.empty()){
            // degl.size() >= 2
            int x = 0;
            for (int v : del){
                ans[v] = x;
                x ^= 1;
            }
            return ;
        }
        sfs(sfs,deg2);
        int i = 0;
        for (int i = 0; int v : del){
            int u = *g[v].begin();
            if (ops[i] != -1){
                u = ops[i];
            }
            ans[v] = ans[u]^1;
            i++;
        }
    };
    vector<int> deg2;
    rep(i,0,n){
        g[i].insert(i == n-1 ? 0 : i+1);
        g[i].insert(i == 0 ? n-1 : i-1);
        if (deg(i) == 2){
            deg2.emplace_back(i);
        }
    }
    dfs(dfs,deg2);
    string sans = "";
    rep(i,0,n) sans += (ans[i] == 0 ? 'B' : 'R');
    cout << sans << '\n';
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int t; cin >> t;
    while (t--){
        solve();
    }
}