You are given a string $s$ of lowercase Latin letters. It is required to paint each letter of the string in one of two colors (red or blue) so that if you write all the red letters from left to right and write all the blue letters from left to right, then the lexicographically maximum of the two written strings is lexicographically minimal. For each index, in the string $s$ you can choose either of two colors.

Formally, we write out:

• the string $r$ (can be empty) — all red letters in the order from left to right (red subsequence),
• the string $b$ (can be empty) — all blue letters in the order from left to right (blue subsequence).

Your task is to paint the string such that $\max(r, b)$ is minimal. Small reminder: the empty string is the lexicographically smallest string.

The first line contains an integer $t$ ($1 \le t \le 100$) — the number of test cases in the test. Next, the test cases are given, one per line.

Each test case is a non-empty string $s$ of length between $2$ to $100$ characters, inclusive, which consists of lowercase Latin letters.

Print $t$ lines, the $i$-th of them should contain the answer to the $i$-th test case of the input. Print a string of length $n$, where $n$ is the length of the given string $s$: the $j$-th character of the string should be either 'R'or 'B' depending on the color of the $j$-th character in the answer (painted in red or blue). If there are several possible answers, print any of them.