t = int(input())
for i in range(t):
n, r, b = map(int, input().split())
b+=1
x = r//b
y = r%b
ans = ""
for j in range(y):
ans+=(x+1)*"R"+"B"
for j in range(b-y):
ans+=x*"R"+"B"
ans = ans[:-1]
print(ans)#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll ;
typedef unsigned long long ull;
typedef pair<int,int>PII;
const int N = 2e5 + 5;
// int a[N],n;
bool st[N];
void solve()
{
int n,r,b;
cin>>n>>r>>b;
int a = b + 1;
int p = (r + a - 1)/ a;
string s;
int t = 0;
for(int i = 1;i <= n;){
while(t < p && r)s += 'R',r--,t++,++i;
if(i > n)break;
a--;
p = (r + a - 1) / a;
s+='B';
t = 0;
++i;
}
cout<<s<<"\n";
}
signed main()
{
std::cin.tie(nullptr),std::cout.tie(nullptr)->std::ios::sync_with_stdio(false);
int T = 1;
cin>>T;
while(T--)solve();
return 0;
}1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |