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
55
56
57
58
59
60
61
62
63
64
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
using namespace std;

void solveOne() {
	int n, m;
	scanf("%d %d", &n, &m);

	map<int, int> first;
	map<int, int> second;
	set<int> otherWinning;

	for (int i = 0; i < m; ++i) {
		int a, b;
		char sign;
		scanf("%d %c %d", &a, &sign, &b);
		if (sign == '<') {
			first[a] ++;
			otherWinning.insert(b);
		}
		else {
			second[b] ++;
		}
	}

	bool AAll = false;
	bool BAll = true;
	bool BEveryone = false;
	for (int i = 1; i <= n; ++i) {
		if (second[i] == n) {
			AAll = true;
		}

		if (first[i] == 0) {
			BAll = false;
		}
		if (first[i] == n) {
			BEveryone = true;
		}
	}

	if (AAll) {
		puts("WYGRANA");
	}
	else if (BEveryone || otherWinning.size() >= n) {
		puts("PRZEGRANA");
	}
	else {
		puts("REMIS");
	}
	return;
}

int main()
{
	int t;
	scanf("%d", &t);
	while (t-- > 0) {
		solveOne();
	}
    return 0;
}