#include<bits/stdc++.h>
#include<set>
using namespace std;
const string No="Let's go to the library!!";
typedef struct Fname
{
	string name;
	string question;
}Friend;
Friend box[150];
void query(int n,int q)
{
	string a;
	char ch;
	for(int i=0;i<q;i++)
	{
		cin>>ch;
		a=a+ch;
	}
	//cout<<"a:"<<a<<endl;
	int flag=0;
	int ni,loc;
	for(ni=0;ni<n;ni++)
	{
		//cout<<box[ni].name<<": "<<box[ni].question<<endl;
		if(box[ni].question==a)
		{
			flag++;
			loc=ni;
		}
	}
	//cout<<"flag:"<<flag<<endl;
	if(flag!=1)
		cout<<No<<endl;
	else
		cout<<box[loc].name<<endl;
}
void solve()
{
	//ios::sync_with_stdio(false);
	
	int n,q; cin>>n>>q;
	int friend_num; cin>>friend_num;
	for(int fi=0;fi<friend_num;fi++)
	{
		cin>>box[fi].name;
		box[fi].question="";
	}//将人名存入结构体
	string nm;
	for(int qqi=0;qqi<q;qqi++)
	{
		int fnum_this_round;
		cin>>fnum_this_round;
		set<string>name_this_round;
		for(int ffi=0;ffi<fnum_this_round;ffi++)
		{
			cin>>nm;
			name_this_round.insert(nm);
		}
		for(int nni=0;nni<friend_num;nni++)
		{
			if(name_this_round.count(box[nni].name)!=0)
				box[nni].question=box[nni].question+'1';
			else
				box[nni].question=box[nni].question+'0';
		}
	}
	for(int qqqi=0;qqqi<n;qqqi++)
		query(friend_num,q);
}
int main()
{
	int t;
	cin>>t;
	for(int ti=0;ti<t;ti++)
		solve();
	return 0;
}