#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("balanta.in");
ofstream g("balanta.out");
int n, m, a[1027], k, r, v[1027], s, best, el;
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++){
        f >> k;
        for(int j = 1; j <= 2 * k; j++) f >> a[j];
        f >> r;
        if(r == 0)
            for(int j = 1; j <= 2 * k; j++) v[a[j]] = int(2e9);
        if(r == 1){
            for(int j = 1; j <= k; j++) if(v[a[j]] != int(2e9)) v[a[j]]++;
            for(int j = k + 1; j <= 2 * k; j++) if(v[a[j]] != int(2e9)) v[a[j]]--;
        }
       if(r == 2){
            for(int j = 1; j <= k; j++)if(v[a[j]] != int(2e9)) v[a[j]]--;
            for(int j = k + 1; j <= 2 * k; j++) if(v[a[j]] != int(2e9)) v[a[j]]++;
        }
    }
    for(int i = 1; i <= n; i++)
    if(v[i] != int(2e9)){
        if(abs(v[i]) > best) best = abs(v[i]), s = 1, el = i;
        else if(abs(v[i]) == best) s++;
    }
    if(s == 1) g << el;
    else g << 0;
    return 0;
}