#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("balanta.in"); ofstream fout("balanta.out");

int i,j,n,m,tip,uz[10025],x,p,a[1025],c[1024],t,max1=0,poz,ok=0,k,k1;


int main()
{
    fin >> n >> p;

    for(int i = 1; i <= p; ++i)
    {
        fin >> m;

        for(int j = 1; j <= 2 * m; ++j)
            fin >> c[j];

        fin >>tip;
        for(int j = 1; j <= 2 * m; ++j)
            if(tip == 1)
            {
                if(j <= m)
                    a[c[j]]++;

                else
                    a[c[j]]--;
            }

            else if(tip == 2)
            {
                if(j <= m)
                    a[c[j]]--;

                else
                    a[c[j]]++;
                }

            else if(tip==0)
            {
                a[c[j]] = 0;
                uz[c[j]] = 1;
            }

    }

    for(int i = 1; i <= n; ++i)
    {

        if(max1<abs(a[i])&&!uz[i])
        {
            max1 = abs(a[i]);
            poz = i;
        }

        else if(max1 == abs(a[i]))
        {
            max1 = 0;
            poz = 0;
        }

    }

    fout << poz;

    fin.close(); fout.close();

    return 0;
}