poj1029

//============================================================================
// Name        : 1029.cpp
// Author      : sww
// Version     : 1.0
// Time	       : 2013-11-18 21:04:59
//===========================================================================

#include <stdio.h>
#include <cstring>
#define N 1000
#define K 100
#define P (N/2)

using namespace std;

bool normal[N + 1];
bool heavy[N + 1];
bool light[N + 1];
bool trying[N + 1];

int left[P];
int right[P];
int n, k, p;
char ch;

int main() {
	scanf("%d %d", &n, &k);
	for (int i = 0; i < k; i++) {
		scanf("%d", &p);
		memset(trying, 0, sizeof(trying));

		for (int j = 0; j < p; j++) {
			scanf("%d", &left[j]);
			trying[left[j]] = true;
		}
		for (int j = 0; j < p; j++) {
			scanf("%d", &right[j]);
			trying[right[j]] = true;
		}
		scanf("\n%c", &ch);
		if (ch == '=') {
			for (int j = 0; j < p; j++) {
				normal[left[j]] = true;
				normal[right[j]] = true;
			}
		} else if (ch == '<') {
			for (int j = 0; j < p; j++) {
				light[left[j]] = true;
				heavy[right[j]] = true;
			}
			for (int i = 1; i <= n; i++) {
				if (!trying[i]) {
					normal[i] = true;
				}
			}
		} else if (ch == '>') {
			for (int j = 0; j < p; j++) {
				heavy[left[j]] = true;
				light[right[j]] = true;
			}
			for (int i = 1; i <= n; i++) {
				if (!trying[i]) {
					normal[i] = true;
				}
			}
		}
	}
	int re = 0;
	int count = 0;

	for (int i = 1; i <= n; i++) {
		if (!(normal[i] || (light[i] && heavy[i]))) {
			re = i;
			count++;
		}
	}
	if (count != 1) {
		puts("0");
	} else {
		printf("%d\n", re);
	}
	return 0;
}