#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

typedef unsigned long long uLL;

typedef long long ll;

typedef pair<int, LL>P;

const int M = 1e2 + ;

const int N = 1e5 + ;

const LL mod = 1e9 + ;

const LL lINF = 0x3f3f3f3f3f3f3f3f;

#define ls (rt<<1)

#define rs (rt<<1|1)

LL cnt[M],n,k;

string s1 = "COFFEE";

string s2 = "CHICKEN";

char ss[N];

int tot;

void solve(LL n,LL k)

{

    if (n >  && k > cnt[n - ])

        solve(n - , k - cnt[n - ]);

    else if (n > )

    {

        solve(n - , k);

        if (k +  - cnt[n - ] >= )

            solve(n - , );

    }

    if (n == )

    {

        if (tot > )

            return;

        for (int i = k - ; i < s1.size(); i++)

        {

            ss[tot++] = s1[i];

        }

    }

    else if (n == )

    {

        if (tot > )

            return;

        for (int i = k - ; i < s2.size(); i++)

        {

            ss[tot++] = s2[i];

        }

    }

}

int main()

{

    cnt[] = ;

    cnt[] = ;

    for (int i = ; i < ; i++)

    {

        cnt[i] = cnt[i - ] + cnt[i - ];

        //cout << cnt[i] << endl;

    }

    int _;

    scanf("%d", &_);

    while(_--)

    {

        scanf("%lld%lld", &n, &k);

        if (n > )

            n = ;

        tot = ;

        solve(n, k);

        for (int i = ; i < min(tot, ); i++)

        {

            printf("%c", ss[i]);

        }

        puts("");

    }

}