/*
* Author: Xiangmy
* Created: 2024-03-21 18:30
* Problem: 
* Description: 
*/
// #pragma GCC optimize(2)
// #pragma GCC optimize(3, "Ofast", "inline")
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << (x) << ' '
// #define x first
// #define y second
typedef long long LL;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> PII;

void solve() {
    int n, m; cin >> n >> m;
    int k; cin >> k;
    vector<string> s;
    for (int i = 0; i < k; ++ i) {
        string x; cin >> x;
        s.push_back(x);
    }
    map<string, string> mp;
    for (int v = 1; v <= m; ++ v) {
        int c; cin >> c;
        for (int i = 1; i <= c; ++ i) {
            string ss; cin >> ss;
            mp[ss] += '1';
        }
        for (int i = 0; i < k; ++ i) {
            if (mp[s[i]].size() != v) mp[s[i]] += '0';
        }
    }
    for (int i = 1; i <= n; ++ i) {
        string t;
        for (int j = 1; j <= m; ++ j) {
            string c; cin >> c;
            t += c;
        }
        int cnt = 0;
        string man;
        for (auto [x, y] : mp) {
            if (y == t) {
                cnt ++;
                man = x;
            }
        }
        if (cnt == 1) {
            cout << man << "\n";
        } else cout << "Let's go to the library!!\n";
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);  // 交互题不用
    cout.tie(0);
    // cout << fixed << setprecision(6);
    // cout << setw(4) << setfill('0');
    // init();
    int T = 1;
    cin >> T;
    while (T -- ) {
        // cin.ignore(numeric_limits<std::streamsize>::max(), '\n');
        solve();
    }
    return 0;
}