#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<bitset>
#include<iomanip>
#include<tuple>
#include<numeric>



#define ll long long
#define inf 0x3f3f3f3f
#define lc p<<1
#define rc p<<1|1
#define endl '\n'
#define all(a) a.begin()+1,a.end()
#define all0(a) a.begin(),a.end()
#define lowbit(a) (a&-a)
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl

using namespace std;
const double eps=1e-6;
typedef pair<int,int>PII;

void solve()
{
	int n,q;
	cin>>n>>q;
	vector<vector<int>>f(n+1,vector<int>(q+1));
	vector<string>g[q+1];
	set<string>op;
	int m;cin>>m;
	for(int i=1;i<=m;i++)
	{
		string s;cin>>s;
		op.insert(s);
	}
	set<string>s2;
	for(int i=1;i<=q;i++)
	{
		int x;cin>>x;
		while(x--)
		{
			string s;cin>>s;
			g[i].pb(s);
			s2.insert	(s);
		}
	}
	
	for(int i=1;i<=n;i++)
	{
		map<string,int>mp;
		set<string>s;
		int cnt=0;
		for(int j=1;j<=q;j++)
		{
			cin>>f[i][j];
			if(f[i][j]==1)
			{
				cnt++;
				for(auto t:g[j]) mp[t]++;
			}
			else
			{
				for(auto t:g[j]) mp[t]=-1e9;
			}
			
		}
		for(auto [x,y]:mp)
		{
			if(y==cnt) s.insert(x);
		}
		if(cnt==0 && op.size()-s2.size()==1)
		{
			
			for(auto t:op)
			{
				//cout<<t<<endl;
				if(!s2.count(t)) {cout<<t<<endl;break;}
			}
		}
		else if(s.size()==1) {cout<<*s.begin()<<endl;}
		else cout<<"Let's go to the library!!"<<endl;
	}
	
	
}
	
	
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int t;cin>>t;
	while(t--)
	solve();
	
	return 0;
}