OtterZ decided to make a weapon using ghostfires. He collected several ghostfires in colors red, green, and blue. He will put some of the ghostfires in a row to build the weapon. To make the weapon more powerful, OtterZ will use as many ghostfires as possible, but the weapon will be out of control if there are two ghostfires of the same color adjacent or separated by exactly two ghostfires in the row. Formally, OtterZ collected (r) red ghostfires, (g) green ghostfires, and (b) blue ghostfires. He wants to construct a string (s) consisting of the characters ' R ', ' G ', and ' B ' that satisfies the following conditions: The number of occurrences of ' R ', ' G ', and ' B ' in (s) does not exceed (r), (g), and (b), respectively. For all (1 \le i \le |s|-1), (s_i \ne s_{i+1}). For all (1 \le i \le |s|-3), (s_i \ne s_{i+3}). The length of (s) is the maximum possible. Help OtterZ to construct the row. Although there may be several possible rows, OtterZ just requires one of them. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The only line of each test case contains three integers (r), (g), and (b) ((0\le r,g,b \le 10 ^ 6), (r+g+b \gt 0)), representing the number of red, green, and blue ghostfires, respectively. It is guaranteed that the sum of (r + g + b) over all test cases does not exceed (10 ^ 6). For each query, output a string (s) consisting of the characters ' R ', ' G ', and ' B ', where (s_i) equals ' R ', ' G ' or ' B ' indicates that the (i)-th ghostfire is colored red, green, or blue, respectively. If there are multiple answers, output any. For the first test case, " B " is the only valid construction. For the second test case, " RGB ", " RBG ", " GRB ", " GRB ", " BRG ", and " BGR " are all correct. For the third test case, " GG " and " GGG "