#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, q;
    std::cin >> n >> q;
    
    int c;
    std::cin >> c;
    
    std::vector<std::string> p(c);
    std::map<std::string, int> id;
    for (int i = 0; i < c; i++) {
        std::cin >> p[i];
        id[p[i]] = i;
    }
    
    std::vector<int> ans(c);
    for (int i = 0; i < q; i++) {
        int m;
        std::cin >> m;
        
        for (int j = 0; j < m; j++) {
            std::string s;
            std::cin >> s;
            ans[id[s]] |= 1 << i;
        }
    }
    
    std::map<int, int> cnt, f;
    for (int i = 0; i < c; i++) {
        cnt[ans[i]]++;
        f[ans[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        int mask = 0;
        for (int j = 0; j < q; j++) {
            int x;
            std::cin >> x;
            mask |= x << j;
        }
        if (cnt[mask] == 1) {
            std::cout << p[f[mask]] << "\n";
        } else {
            std::cout << "Let's go to the library!!\n";
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}