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
#include <iostream>
#include <sstream>
#include <vector>

using namespace std;

stringstream out;

int decks[100000];


int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--)
	{
		int n, m;
		cin >> n >> m;
		for (int i = 0; i < n; i++)
			decks[i] = 0;

		for (int i = 0; i < m; i++)
		{
			int a, b;
			char w;
			cin >> a >> w >> b;
			a--;
			b--;
			if (w == '<')
				decks[b] = -1;
			else
				decks[b] = (decks[b] == -1 ? -1 : decks[b] + 1);
		}

		int best = -1;
		for (int i = 0; i < n; i++)
		{
			if (decks[i] == -1)
				continue;
			if (decks[i] == n)
			{
				best = 1;
				break;
			}
			best = 0;
		}
		out << (best == -1 ? "PRZEGRANA\n" : best == 0 ? "REMIS\n" : "WYGRANA\n");
	}

	cout << out.str();
	return 0;
}