/**


*/

#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 17;
const ll Mod = 1e9+7;
const ll inf = 0x3f3f3f3f;
ll n;
int c[33];
ll a[33];
int main()
{
    ll p = 1;
    a[0] = 1;
    for(int i = 1; i < 30; i++){
        p *= 3;
        a[i] = p;
    }
    int T, m;
    cin>>T;
    while(T--)
    {
        scanf("%d%I64d",&m,&n);
        for(int i = 0; i < m; i++){
            c[i] = n/a[m-1-i]%3;
        }
        for(int i = 0; i < m; i++){
            if(c[i]==0){
                printf("R");
            }else
            {
                if(c[i]==1){
                    printf("G");
                }else
                {
                    printf("B");
                }
            }
        }
        printf("\n");
    }
    return 0;
}