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
#include<iostream>
#include<vector>
#include<unordered_map>


using namespace std;


void insertValue(unordered_map<int,int> &tab,int key){

    if(tab.find(key) == tab.end()){
        tab[key] = 1;
    }
    else{
        int tmp = tab[key];
        tab[key] = tmp+1;
    }

}

int main(){
    int tests;

    cin>>tests;

    for(int test=0;test<tests;++test){

        int n,k;
        cin>>n>>k;

        unordered_map<int,int> bajtGreater;
        unordered_map<int,int> bajtLess;

        unordered_map<int,int> bitGreater;
        unordered_map<int,int> bitLess;

        int bajt,bit;
        char symbol;
        for(int i=0;i<k;i++){
            cin>>bajt>>symbol>>bit;


            if(symbol == '>'){
                insertValue(bajtGreater,bajt);
                insertValue(bitLess,bit);
            }
            else {
                insertValue(bajtLess,bajt);
                insertValue(bitGreater,bit);
                
            }
        }

        int maxBajt = 0;
        int maxBit = 0;

        for(auto &value : bajtLess){
            if(maxBajt < value.second)
                maxBajt = value.second;
        }
        for(auto &value : bitLess){
            if(maxBit < value.second) 
               maxBit = value.second;
        }

        if(maxBajt == n && maxBit != n){
            cout<<"PRZEGRANA"<<endl;
        }
        else if(maxBajt != n && maxBit == n){
            cout<<"WYGRANA"<<endl;
        }else {

            if(bajtLess.size() == n && bitGreater.size() == n){
                cout<<"PRZEGRANA"<<endl;
            }
            else
                cout<<"REMIS"<<endl;
        }


    }


return 0;
}