There is a machine with m(2≤m≤30) coloured bulbs and a button.When the button is pushed, the rightmost bulb changes.
For any changed bulb,

if it is red now it will be green;

if it is green now it will be blue;

if it is blue now it will be red and the bulb that on the left(if it exists) will change too.

Initally all the bulbs are red. What colour are the bulbs after the button be
pushed n(1≤n<263) times?

There are multiple test cases. The first line of input contains an integer T(1≤T≤15) indicating the number of test cases. For each test case:

The only line contains two integers m(2≤m≤30) and n(1≤n<263).

For each test case, output the colour of m bulbs from left to right.
R indicates red. G indicates green. B indicates blue.

2
3 1
2 3

RRG
GR

wange2014   |   We have carefully selected several similar problems for you:  5674 5673 5672 5671 5669 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	char s[3]={'R','G','B'},ans[32];
	int t,m,i;
	__int64 n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%I64d",&m,&n);
		for(i=m;i>0;i--)
		{
			ans[i]=s[n%3];
			n=n/3;
		}
		for(i=1;i<=m;i++)
		printf("%c",ans[i]);
		printf("\n");
	}
	return 0;
}