#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cstdlib>#include <cmath>#include <vector>#include <map>#include <algorithm>#include <set>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn = 61111;typedef vector<int> VI;vector<int> V[maxn];vector<int> R[maxn];int deg[maxn];int arr[maxn];int cnt;string name[maxn<<1];int main(){ int n,m,q,i,k,j,u,v; int T; cin>>T; while(T--) { map<string,int>mp; string a,b; cnt=0; cin>>n>>m>>q; n+=m; for(i=0;i<n+10;++i) V[i].clear(),R[i].clear(); for(i=0;i<n;++i) { cin>>a; if(!mp.count(a)) mp[a]=cnt,name[cnt++]=a; u=mp[a]; cin>>k; for(j=0;j<k;++j) { cin>>b; if(!mp.count(b)) mp[b]=cnt,name[cnt++]=b; v=mp[b]; V[u].push_back(v); R[v].push_back(u); } } for(i=0;i<cnt;++i) sort(V[i].begin(),V[i].end()); for(i=0;i<q;++i) { cin>>k; set<int>s; int tv=0; for(j=0;j<k;++j) { cin>>b; arr[j]=mp[b]; s.insert(arr[j]); } bool flag; for(j=0;j<k;++j) { flag=false; for(int t=0;t<(int)R[arr[j]].size();++t) { flag|=s.count(R[arr[j]][t]); if(flag) break; } if(!flag) ++tv,u=arr[j]; if(tv>1) break; } if(tv!=1) cout<<0<<endl; else if(tv==1) { int pv=0; for(j=0;j<k;++j) { if(arr[j]==u) continue; if(binary_search(V[u].begin(),V[u].end(),arr[j])) ++pv; } if(pv==k-1) cout<<1<<' '<<name[u]<<endl; else cout<<0<<endl; } } cout<<'n'; } return 0;}
