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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <tuple>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;








int main() {
	/*ifstream cin("input.txt");
	ofstream cout("output.txt");*/
	int tt;
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> tt;
	for (int t = 0; t < tt; t++)
	{
		int n, m;
		cin >> n >> m;
		unordered_map <int, int> win, lose;
		for (int i = 0; i < m; i++)
		{
			int a, b;
			char c;
			cin >> a >> c >> b;
			if (c == '>')
			{
				win[b]++;
			}
			else
			{
				lose[a]++;
			}
		}
		int flag = 0;
		for (pair <int, int> z : win)
		{
			if (z.second == n)
			{
				flag = 1;
			}
		}
		if (flag == 1)
		{
			cout << "WYGRANA\n";
		}
		else
		{
			for (int i = 1; i <= n; i++)
			{
				if (lose.find(i) == lose.end())
					flag = 2;
			}
			if (flag == 2)
			{
				cout << "REMIS\n";
			}
			else
			{
				cout << "PRZEGRANA\n";
			}
		}
	}
}