1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <cstdio>

bool isBetter[100001];
int howManyBetter[100001];
int t, n, m, a, b;
char c;

void zeruj(int n) {
	for (int i = 1; i <= n; i++) {
		isBetter[i] = 0;
		howManyBetter[i] = 0;
	}
}

bool checkWin(int n) {
	for (int i = 1; i <= n; i++) {
		if (howManyBetter[i] == n)
			return true;
	}
	return false;
}

bool checkLose(int n) {
	for (int i = 1; i <= n; i++) {
		if (isBetter[i] == false)
			return false;
	}
	return true;
}

int main() {
	
	scanf("%d", &t);
	
	while (t--) {
		scanf("%d%d", &n, &m);
		zeruj(n);
		for (int i = 1; i <= m; i++) {
			scanf("%d %c%d", &a, &c, &b);
			if (c == '<')
				isBetter[b] = 1;
			else
				howManyBetter[b]++;
		}
		if (checkWin(n))
			printf("WYGRANA\n");
		else if (checkLose(n))
			printf("PRZEGRANA\n");
		else
			printf("REMIS\n");
		
	}
	return 0;
	}