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
#include <bits/stdc++.h>
using namespace std;

#define fru(j,n) for(int j=0; j<(n); ++j)
#define tr(it,v) for(auto it=(v).begin(); it!=(v).end(); ++it)
//#define tr(it,v) for(typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define x first
#define y second
#define pb push_back
#define ALL(G) (G).begin(),(G).end()

#if 1
	#define DEB printf
#else
	#define DEB(...)
#endif

typedef long long ll;
typedef long long LL;
typedef double D;
typedef pair<int,int> pii;
typedef vector<int> vi;

const int inft = 1000000009;
const int mod = 1000000007;
const int MAXN = 1000006;

void solve() {
	int n,m;
	scanf("%d%d",&n,&m);
	vi P(n,0),W(n,0);
	fru(i,m){
		int a,b;
		char c;
		scanf("%d %c %d",&a,&c,&b);a--;b--;
		if(c=='<')W[b]++;
		else P[b]++;
	}
	bool prz=1;
	fru(i,n)prz&=(W[i]>0);
	bool rem=1;
	fru(i,n)rem&=(P[i]!=n);
	puts(prz?"PRZEGRANA":(rem?"REMIS":"WYGRANA"));
}

int main() {
	int te = 1;
	scanf("%d",&te);
	fru(ti,te) solve();
	return 0;
}