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
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 100007;

int indeg[MAX_N], outdeg[MAX_N];
int t, n, m;

void readCaseInput() {
    scanf("%d %d", &n, &m);

    for (int i = 0; i < m; ++i) {
        int a, b;
        char sign;
        scanf("%d %c %d", &a, &sign, &b);
        sign == '>' ? ++indeg[b] : ++outdeg[b];
    }
}

bool leftWinning() {
    int maxIndeg = 0;

    for (int i = 1; i <= n; ++i) {
        maxIndeg = max(maxIndeg, indeg[i]);
    }

    return maxIndeg == n ? true : false;
}

bool rightWinning() {
    for (int i = 1; i <= n; ++i) {
        if (outdeg[i] == 0) {
            return false;
        }
    }
    return true;
}

void solveCase() {
    if (leftWinning()) {
        printf("WYGRANA\n");
    }   else if (rightWinning()) {
        printf("PRZEGRANA\n");
    }   else {
        printf("REMIS\n");
    }
}

void clearData() {
    for (int i = 1; i <= n; ++i) {
        indeg[i] = outdeg[i] = 0;
    }
}

int main() {
    scanf("%d", &t);
    for (int i = 0; i < t; ++i) {
        readCaseInput();
        solveCase();
        clearData();
    }
    return 0;
}