#include <bits/stdc++.h>

using namespace std;

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

set<int> sus;

int main() {
  int n, m, k, res;
   
  fin >> n >> m;
  for ( int i = 1; i <= n; ++i ) {
	sus.insert(i);
  }
  while ( m-- ) {
	fin >> k;
    vector<int> left(k), right(k);
	for ( int i = 0; i < k; ++i ) {
	  fin >> left[i];
	}
	for ( int i = 0; i < k; ++i ) {
      fin >> right[i];
	}
    fin >> res;
    for ( int i = 0; i < k; ++i ) {
	  if ( sus.count(left[i]) && res != 1 ) sus.erase(sus.find(left[i]));
      if ( sus.count(right[i]) && res != 2 ) sus.erase(sus.find(right[i]));
	}
  }
  fout << (sus.size() == 1 ? *sus.begin() : 0);
  fin.close();
  fout.close();
  return 0;
}