#include <iostream>
#include <bitset>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define fst first
#define scd second
#define ll long long
#define db double
#define L(i, j, k) for (int i=(j); i<=(k); ++i)
#define R(i, j, k) for (int i=(j); i>=(k); --i)
#define mp make_pair
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vl vector <ll>
#define eb emplace_back
#define pb push_back
#define sz(x) ((int) x.size())
#define ms(f, x) memset(f, x, sizeof (f))
#define ACN(i, h_u) for (int i=h_u; i; i=e[i].nxt)
using namespace std;
template <typename INT> void rd(INT &res) {
	res=0; bool f=false; char ch=getchar();
	while (ch<'0'||ch>'9') f|=(ch=='-'), ch=getchar();
	while (ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48), ch=getchar();
	res=(f?-res:res);
}
template <typename INT, typename ...Args>
void rd(INT &res, Args &..._res) { rd(res), rd(_res...); }
//dfs
const int maxn=2e5;
const int N=maxn+10;
set <int> e[N], s[N]; bool col[N]; int n, m;
//wmr

//incra
void dfs() {
	int sign=!s[2].empty()?2:!s[1].empty()?1:0;
	if (sign) {
		int u=*s[sign].begin(); s[sign].erase(u);
		for (int v: e[u]) s[sz(e[v])].erase(v), e[v].erase(u), s[sz(e[v])].insert(v);
		dfs(); col[u]=!col[*e[u].begin()];
	}
}
//lottle
signed main() {
//	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	int T; rd(T);
	while (T--) {
		rd(n, m);
		L(i, 0, n) set <int> ().swap(e[i]), set <int> ().swap(s[i]);
		L(i, 2, n) e[i].insert(i-1), e[i].insert(i+1);
		e[1].insert(n), e[1].insert(2); e[n].insert(n-1), e[n].insert(1);
		while (m--) { int u, v; rd(u, v); e[u+1].insert(v+1); e[v+1].insert(u+1); }
		L(i, 1, n) s[sz(e[i])].insert(i);
		dfs();
		L(i, 1, n) putchar(col[i]?'R':'B');
		puts("");
	} 
	return 0;
}