A. Palindrome ABC
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Given three integers $$$a$$$, $$$b$$$, $$$c$$$, write the lexicographically smallest palindrome with $$$a$$$ 'A's, $$$b$$$ 'B's, and $$$c$$$ 'C's. If no palindrome can be formed with that number of letters, write 'ROP'.

Input

The input starts with an integer $$$t$$$ indicating the number of test cases. Each case contains a line with three integers $$$a$$$, $$$b$$$, and $$$c$$$.

Output

For each case, output a line with the answer.

Scoring

$$$0 \leq a, b, c \leq 1000$$$

$$$t \leq 1000$$$

At least one of the integers is different from $$$0$$$.

14 points: Two of the integers are $$$0$$$.

27 points: All integers are even.

59 points: No additional conditions.

Example
Input
4
1 0 0
2 2 2
2 0 3
1 3 5
Output
A
ABCCBA
ACCCA
ROP