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

void solve(){
	int n,m;cin>>n>>m;
	vector<int> c(n+1);
	vector<pair<int,pair<int,int> > > g;
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		int x=(u-v)%n;
		x=(x+n)%n;
		int y=(v-u)%n;
		y=(y+n)%n;
		x=min(x,y);
			g.push_back({x,{v,u}});
	}
	sort(g.begin(),g.end());
	for(auto [_,e]:g){
		auto [u,v]=e;
		if(c[u]&&c[v]) continue;
		if(c[u]){
			c[v]=3-c[u];
		} 
		else if(c[v]){
			c[u]=3-c[v];
		}
		else{
			c[u]=1,c[v]=2;
		}
	}
	int cc=0; 
	for(int i=0;i<n;i++){
		if(!c[i]){
			cc=(i-1+n)%n;
			if(c[cc]){
				c[i]=3-c[cc];
			} 
			else if(c[(i+1)%n]){
				c[i]=3-c[(i+1)%n];
			}
			else c[i]=1;
		}
		if(c[i]==1){
			cout<<"B";
		}
		else if(c[i]==2){
			cout<<"R";
		}

	}
			cout<<"\n";
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
	int T;cin>>T;
	while(T--)
	solve(); 
}