#include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<cmath>
#include<vector>
#include<string>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;

const LL maxn = 1100;

LL a[maxn],len;

int main()
{
    LL t,n,m;
    
    scanf("%I64d",&t);
    while( t-- )
    {
        memset( a,0,sizeof a );
        
        scanf("%I64d%I64d",&m,&n);
        LL l = 1;
        for( LL i=1;i<=m;i++ ) l *= 3;
        n %= l;
        
        len = 0;
        while( n != 0 )
        {
            a[++len] = n%3;
            n /= 3;
        }
        for( LL i=m;i>=1;i-- )
        {
            if( a[i] == 0 ) printf("R");
            else if( a[i] == 1 ) printf("G");
            else printf("B");
        }
        printf("\n");
    }
    
    return 0;
}