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

using namespace std;

#define PB push_back
#define FORE(i, t) for(__typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

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

const int INF = 1e9 + 9;

void inline one() {
    int n, m;
    cin >> n >> m;
    int losing_b[n + 1], winning_b[n + 1];
    FOR (i, 1, n) {
        losing_b[i] = winning_b[i] = 0;
    }
    REP (i, m) {
        int a, b;
        string w;
        cin >> a >> w >> b;
        if (w[0] == '>') {
            ++losing_b[b];
        } else {
            ++winning_b[b];
        }
    }
    bool win = false, draw = false;
    FOR (i, 1, n) {
        if (losing_b[i] == n) {
            win = true;
            break;
        }
        if (winning_b[i] == 0) {
            draw = true;
        }
    }
    if (win) {
        cout << "WYGRANA\n";
    } else if (draw) {
        cout << "REMIS\n";
    } else {
        cout << "PRZEGRANA\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    int z; cin >> z; while(z--)
    one();
}