#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;
using i128 = __int128;

#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

#ifdef DEBUG
    #define cout cout << "\033[1;92m"
    #define endl "\033[0m" << '\n';
#else
    #define endl '\n'
#endif

struct Hash {
    const i64 P = 1e12 + 39;
    const int B = 13331;
    vector<i64> h, p;
    Hash(string s) : h(s.size() + 1), p(s.size() + 1) {
        int n = s.size();
        p[0] = 1;
        for (int i = 0; i < n; i++) {
            h[i + 1] = (h[i] * B + s[i]) % P;
            p[i + 1] = p[i] * B % P;
        }
    }

    //左闭右开 从 0 开始
    i64 get(int l, int r) {
        return (h[r] + __int128(h[l]) * (P - p[r - l])) % P;
    }
};

void solve() {
    int n;
    cin >> n;
    vector<vector<string>> arr(n+1);
    unordered_map<string, bool> vis;

    Hash t("bie");
    
    for (int i = 1; i <= n; ++i) {
        int m;
        cin >> m;
        bool check = false;
        for (int j = 1; j <= m; ++j) {
            string s;
            cin >> s;
            if (vis[s]) continue;

            Hash hs(s);
            int slen = s.size();
            for (int p = 0; p <= slen-3; ++p) {
                if (hs.get(p, p+3) == t.get(0,3)) {
                    vis[s] = true;
                    cout << s << endl;
                    check = true;
                    break;
                }
            }
        }
        if (!check) {
            cout << "Time to play Genshin Impact, Teacher Rice!" << endl;
        }
    }
}

signed main() {
    IOS;
    int t{1};
    // cin >> t;
    while (t--) {
        solve();
    }

    //system("pause");
}