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
#include <cstdio>
using namespace std;

int t;
int n, m;

int b1[100001];
int b2[100001];

int a,b;
char c;

int main() {
	scanf("%d", &t);
	
	while(t--) {
		scanf("%d %d", &n, &m);
		for (int i=0;i<=n;i++) {
			b1[i] = b2[i] = 0;
		}
		
		for (int i=0;i<m; i++) {
			scanf("%d %c %d", &a, &c, &b);
			if (c == '>') {
				b1[b]++;
			} else {
				b2[a]++;
			}
		}
		
		int max1 = -1;
		int max2 = -1;
		for (int i=1;i<=n;i++) {
			if (max1 < b1[i]) {
				max1 = b1[i];
			}
			if (max2 < b2[i]) {
				max2 = b2[i];
			}
		}
		
		if (max1 == n) {
			printf("WYGRANA\n");
		} else if (max2 == n) {
			printf("PRZEGRANA\n");
		} else {
			printf("REMIS\n");
		}
	}
	return 0;
}