1659A · Red Versus Blue

Problem: Team Red and Team Blue competed in a competitive FPS. Their match was streamed around the world. They played a series of $n$ matches.

In the end, it turned out Team Red won $r$ times and Team Blue won $b$ times. Team Blue was less skilled than Team Red, so $b$ was strictly less than $r$.

You missed the stream since you overslept, but you think that the match must have been neck and neck since so many people watched it. So you imagine a string of length $n$ where the $i$-th character denotes who won the $i$-th match  — it is R if Team Red won or B if Team Blue won. You imagine the string was such that the maximum number of times a team won in a row was as small as possible. For example, in the series of matches RBBRRRB, Team Red won $3$ times in a row, which is the maximum.

You must find a string satisfying the above conditions. If there are multiple answers, print any.

Input Format: The first line contains a single integer $t$ ($1 \le t \le 1000$)  — the number of test cases.

Each test case has a single line containing three integers $n$, $r$, and $b$ ($3 \leq n \leq 100$; $1 \leq b < r \leq n$, $r+b=n$).

Output Format: For each test case, output a single line containing a string satisfying the given conditions. If there are multiple answers, print any.

Note: The first test case of the first example gives the optimal answer for the example in the statement. The maximum number of times a team wins in a row in RBRBRBR is $1$. We cannot minimize it any further.

The answer for the second test case of the second example is RRBRBRBRBR. The maximum number of times a team wins in a row is $2$, given by RR at the beginning. We cannot minimize the answer any further.