#include<cstdio>
#include<cstdlib>
#include<algorithm>

using namespace std;

long a[1027],ap[1027],ap2[1027],poz,max2,m,n;

int mian()
{
	
	long i,tip,x;
	
	freopen("balanta.in","r",stdin);
	freopen("balanta.out","w",stdout);
	
	scanf("%ld %ld",&n,&m);
	
	for (;m!=0;--m)
	{
		
		scanf("%ld",&x);
		
		x*=2;
		
		for (i=1;i<=x;++i)
			scanf("%ld",&a[i]);
		
		scanf("%ld",&tip);
		
		for (i=1;i<=x;++i)
			if (tip==1)
			{
				
				if (i<=x/2)
					--ap[a[i]];
				else
					++ap[a[i]];
			
			}
			else
				if (tip==2)
				{
					
					if (i<=x/2)
						++ap[a[i]];
					else
						--ap[a[i]];
				
				}
				else
					ap2[a[i]]=1;
		
	}
	
	max2=0;poz=0;
	
	for (i=1;i<=n;i++)
	{
		
		if (ap2[i]==0)
			max2=max(max2,abs(ap[i]));
		
		if (max2==ap[i])
			poz=i;
	
	}
	
	printf("%ld",poz);
	
	return 0;
	
}