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

using namespace std;

void solve(){
    int n,m,cnt_b=0,a,b;
    char w;
    cin>>n>>m;
    unique_ptr<bool[]> T(new bool[n+1]());
    unique_ptr<int[]> in(new int[n+1]());
    bool in_n = false;
    for(int i=0;i<m;++i){
	cin>>a>>w>>b;
	if(w == '>'){
	    if(++in[b] == n)
		in_n = true;
	} else if(!T[b]){
	    T[b] = true;
	    cnt_b++;
	}
    }
    if(cnt_b == n)
	cout<<"PRZEGRANA\n";
    else if(in_n)
	cout<<"WYGRANA\n";
    else
	cout<<"REMIS\n";
}

int main(){
    ios_base::sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--)
	solve();
    return 0;
}