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
#include <iostream>
#include <cstdio>

using namespace std;

int t, n, m, a, b;
char c;
bool result;

int tab[100005];
int kab[100005];

int main ()
{
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; ++i) tab[i] = kab[i] = 0;
		for (int i = 0; i < m; ++i)
		{
			scanf("%d %c %d", &a, &c, &b);
			if (c == '<') tab[b] = 1;
			else kab[b]++;
		}
		result = 1;
		for (int i = 1; i <= n; ++i)
		{
			if (tab[i] == 0)
			{
				result = 0;
				break;
			}
		}
		if (result)
		{
			printf("PRZEGRANA\n");
			continue;
		}
		for (int i = 1; i <= n; ++i)
		{
			if (kab[i] == n)
			{
				result = 1;
				break;
			}
		}
		if (result) printf("WYGRANA\n");
		else printf("REMIS\n");
	}
	return 0;
}