#include <bits/stdc++.h>
using namespace std;
const int N = 100010, MOD = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VLL;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef vector<PII> VPII;
typedef deque<int> DPII;
typedef queue<int> QI;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
unordered_map<string, int> ump;
int t, n, q, c;

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> t;

    string a[210];
    while (t--)
    {
        cin >> n >> q;
        cin >> c;
        int s[210][25] = {0};
        for (int i = 1; i <= c; i++)
        {
            cin >> a[i];
            ump[a[i]] = i;
        }
        for (int i = 0; i < q; i++)
        {
            int k;
            cin >> k;
            while(k--)
            {
                string op;
                cin >> op;
                s[ump[op]][i] = 1;
            }
        }
        int p[210] = {0};
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < q; j++)
            {
                int w;
                cin >> w;
                p[i] += w*(1 << j);
            }
        }
        int u[210] = {0};
        for (int i = 1; i <= c;i++){
            for (int j = 0; j < q;j++){
                u[i] += s[i][j]*(1 << j) ;
            }
        }
        for (int i = 0; i < n; i++)
        {
            int cnt = 0;
            string res;
            for (int j = 1; j <= c; j++)
            {
                if (p[i] == u[j])
                {
                    cnt++;
                    res = a[j];
                }
            }
            if (cnt == 1)
            {
                cout << res << '\n';
            }
            else{
                cout << "Let’s go to the library!!" << '\n';
            }
        }
    }
    
    

    return 0;
}