#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
const int INF = 1<<30;
int getint() {
    int r = 0, k = 1; char c = getchar();
    for (; '0' > c || c > '9'; c = getchar()) if (c == '-') k = -1;
    for (; '0' <= c && c <= '9'; c = getchar()) r = r * 10 - '0' + c;
    return r * k;
}
int m;
LL n;
int dig[150];
char change(int x) {
    if (!x) return 'R';
    if (x&1) return 'G';
    return 'B';
}
void work() {
    int ptr = 0;
    while (n) {
        dig[++ptr] = n % 3;
        n /= 3;
    }
}
int main() {
    int T;scanf("%d", &T);
    while (T--) {
        scanf("%d", &m);
        scanf("%I64d", &n);
        memset(dig, 0, sizeof(dig));
        work();
        for (int i = m; i; --i)
            printf("%c", change(dig[i]));
        puts("");
    }
    return 0;
}