#include <cstdio>
#include <vector>
using namespace std;

#define MAXN 1030

int M, N, seen[MAXN], type[MAXN], seen2[MAXN];
vector<int> V[MAXN];

void read()
{
	scanf("%d %d", &N, &M);

	for (int i = 0; i < M; i++)
	{
		int nr;
		scanf("%d", &nr);
		nr *= 2;
		for (; nr; nr--)
		{
			int p;
			scanf("%d", &p);
			V[i].push_back(p);
			seen2[p] = 1;
		}
		scanf("%d", &type[i]);
	}
}

void mark(vector<int>::iterator itr1, vector<int>::iterator itr2)
{
	for (; itr1 != itr2; itr1++)
		seen[*itr1] = 1;
}

int check(vector<int>::iterator itr1, vector<int>::iterator itr2)
{
	for (; itr1 != itr2; itr1++)
		if (!seen[*itr1])
			return 0;
	return 1;
}

int notE(int p)
{
	if (p == 472)
		p++, p--;
	for (int i = 0; i < M; i++)
	{
		int j;
		for (j = 0; j < V[i].size(); j++)
			if (V[i][j] == p)
				break;
		if (j < V[i].size())
		{
			if (j < V[i].size() / 2)
			{
				int j;
				for (j = 0; j < V[i].size() / 2; j++)
					if (!seen[V[i][j]] && V[i][j] != p)
						break;
				if (j == V[i].size() / 2)
					return 1;
			}
			else
			{
				int j;
				for (j = V[i].size() / 2; j < V[i].size(); j++)
					if (!seen[V[i][j]] && V[i][j] != p)
						break;
				if (j == V[i].size())
					return 1;
			}
		}
	}

	return 0;
}

int getEasy()
{
	memset(seen, 0, sizeof(seen));

	for (int i = 0; i < M; i++)
	{
		if (type[i] == 0)
			mark(V[i].begin(), V[i].end());
		if (type[i] == 1)
			mark(V[i].begin(), V[i].begin() + V[i].size() / 2);
		if (type[i] == 2)
			mark(V[i].begin() + V[i].size() / 2, V[i].end());
	}

	int nr = 0, p;
	for (int i = 1; i <= N; i++)
		if (!seen[i] && seen2[i] && notE(i))
			nr++, p = i;
	if (nr != 1)
		return -1;

	for (int i = 0; i < M; i++)
	{
		if (type[i] == 1)
			if (check(V[i].begin() + V[i].size() / 2, V[i].end()))
				return -1;
		if (type[i] == 2)
			if (check(V[i].begin(), V[i].begin() + V[i].size() / 2))
				return -1;
	}

	return p;
}

int getHard()
{
	memset(seen, 0, sizeof(seen));

	for (int i = 0; i < M; i++)
	{
		if (type[i] == 0)
			mark(V[i].begin(), V[i].end());
		if (type[i] == 2)
			mark(V[i].begin(), V[i].begin() + V[i].size() / 2);
		if (type[i] == 1)
			mark(V[i].begin() + V[i].size() / 2, V[i].end());
	}

	int nr = 0, p;
	for (int i = 1; i <= N; i++)
		if (!seen[i] && seen2[i] && notE(i))
			nr++, p = i;
	if (nr != 1)
		return -1;

	for (int i = 0; i < M; i++)
	{
		if (type[i] == 2)
			if (check(V[i].begin() + V[i].size() / 2, V[i].end()))
				return -1;
		if (type[i] == 1)
			if (check(V[i].begin(), V[i].begin() + V[i].size() / 2))
				return -1;
	}

	return p;
}

void solve()
{
	int p1 = getEasy();
	if (p1 != -1)
	{
		printf("%d\n", p1);
		return;
	}
	p1 = getHard();
	if (p1 != -1)
	{
		printf("%d\n", p1);
		return;
	}
	printf("0\n");
}

int main()
{
	freopen("balanta.in", "r", stdin);
	freopen("balanta.out", "w", stdout);

	read();
	solve();

	return 0;
}