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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> valfirst;
vector<int> valsec;
int main() {
	ios_base::sync_with_stdio(0);
	int t;
	cin>>t;

	for(int i=0;i<t;i++){
		int countt;
		int tof;
		cin>>countt;
		cin>>tof;
		valfirst=vector<int>(countt);
		valsec=vector<int>(countt);
		for(int j=0;j<tof;j++){
			int firstid;
			int secid;
			char com;
			cin>>firstid;
			cin>>com;
			cin>>secid;
			if(com=='>'){
				//valfirst[firstid-1]=valsec[secid-1]+1;
				valsec[secid-1]++;
			}
			else{
				valfirst[firstid-1]++;
				//valsec[secid-1]=valfirst[firstid-1]+1;
			}
		}
		sort(valfirst.begin(),valfirst.end());
		sort(valsec.begin(),valsec.end());
		/*for(int j=0;j<countt;j++){
			cout<<valfirst[j]<<" ";
		}
		cout<<endl;
		for(int j=0;j<countt;j++){
			cout<<valsec[j]<<" ";
		}*/
		/*if(valfirst[0]>valsec[0]){
			cout<<"WYGRANA";
		}
		else if(valfirst[0]==valsec[0]){
			cout<<"REMIS";
		}
		else{
			cout<<"PRZEGRANA";
		}*/
		if(valsec[countt-1]==countt){
			cout<<"WYGRANA";
		}
		else if(valfirst[0]!=0){
			cout<<"PRZEGRANA";
		}
		else{
			cout<<"REMIS";
		}
		cout<<endl;
	}
}