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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define inf 1000000000
#define INF 1000000000000000000LL
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define endl '\n'
#define REP(x, y) for(int x = 0; x < (y); ++x)
#define FOR(x, y, z) for(int x = y; x <= (z); ++x)
using namespace std;

#define N 1000007

int t, n, m, a, b;

bool w1, w2;

char w;

int out2[N];
int in2[N];

void solve()
{
	cin >> n >> m;

	for(int i = 1; i <= n; ++i)
	{
		in2[i] = out2[i] = 0;
	}

	while(m--)
	{
		cin >> a >> w >> b;

		if(w=='<')
		{
			++out2[b];
		}
		else
		{
			++in2[b];
		}	
	}

	w1 = 0;

	for(int i = 1; i <= n; ++i)
	{
		if(in2[i]==n)
		{
			w1 = 1;
			break;
		}
	}

	if(w1)
	{
		cout << "WYGRANA\n";
		return;
	}

	w2 = 1;

	for(int i = 1; i <= n; ++i)
	{
		if(!out2[i])
		{
			w2 = 0;
			break;
		}
	}

	if(w2)
	{
		cout << "PRZEGRANA\n";
		return;
	}

	cout << "REMIS\n";
	return;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

	cin >> t;

	while(t--)
		solve();
}