#include <iostream>
#include <set>
#include <algorithm>
 
using namespace std;
 
int main()
{
	// int t;
	// cin>>t;
	// while(t--) {
	set<int> myfact;
	int f,id,n,num,max_mach=0,max_id=-1;
	cin>>f>>id>>n;
	while(n--) {
		cin>>num;
		myfact.insert(num);
	}
	for(int i=0;i<f;i++) {
		cin>>id>>n;
		set<int> newfact,mergedfact;
		while(n--) {
			cin>>num;
			newfact.insert(num);
		}
		set_union(myfact.begin(),myfact.end(),
			newfact.begin(),newfact.end(),
			inserter(mergedfact,mergedfact.end()));
		int mach_num=mergedfact.size();
		if(mach_num>max_mach) {
			max_mach=mach_num;
			max_id=id;
		}
		else if(mach_num==max_mach&&id<max_id) {
			max_mach=mach_num;
			max_id=id;
		}
	}
	cout<<max_id<<'\n';
	// }
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c2V0PgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkKewoJLy8gaW50IHQ7CgkvLyBjaW4+PnQ7CgkvLyB3aGlsZSh0LS0pIHsKCXNldDxpbnQ+IG15ZmFjdDsKCWludCBmLGlkLG4sbnVtLG1heF9tYWNoPTAsbWF4X2lkPS0xOwoJY2luPj5mPj5pZD4+bjsKCXdoaWxlKG4tLSkgewoJCWNpbj4+bnVtOwoJCW15ZmFjdC5pbnNlcnQobnVtKTsKCX0KCWZvcihpbnQgaT0wO2k8ZjtpKyspIHsKCQljaW4+PmlkPj5uOwoJCXNldDxpbnQ+IG5ld2ZhY3QsbWVyZ2VkZmFjdDsKCQl3aGlsZShuLS0pIHsKCQkJY2luPj5udW07CgkJCW5ld2ZhY3QuaW5zZXJ0KG51bSk7CgkJfQoJCXNldF91bmlvbihteWZhY3QuYmVnaW4oKSxteWZhY3QuZW5kKCksCgkJCW5ld2ZhY3QuYmVnaW4oKSxuZXdmYWN0LmVuZCgpLAoJCQlpbnNlcnRlcihtZXJnZWRmYWN0LG1lcmdlZGZhY3QuZW5kKCkpKTsKCQlpbnQgbWFjaF9udW09bWVyZ2VkZmFjdC5zaXplKCk7CgkJaWYobWFjaF9udW0+bWF4X21hY2gpIHsKCQkJbWF4X21hY2g9bWFjaF9udW07CgkJCW1heF9pZD1pZDsKCQl9CgkJZWxzZSBpZihtYWNoX251bT09bWF4X21hY2gmJmlkPG1heF9pZCkgewoJCQltYXhfbWFjaD1tYWNoX251bTsKCQkJbWF4X2lkPWlkOwoJCX0KCX0KCWNvdXQ8PG1heF9pZDw8J1xuJzsKCS8vIH0KCXJldHVybiAwOwp9

MwoyMyA1IDQgMiAyIDMgMTEgCjEzIDIgMSAzIAoyNSA0IDIgNSAxMSA2IAo2IDMgOSAxMCA0

3
23 5 4 2 2 3 11 
13 2 1 3 
25 4 2 5 11 6 
6 3 9 10 4