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

using namespace std;

struct Deck {
    vector<int> winWith;
    vector<int> loseWith;
    bool play;
    bool used;

    Deck() : play(true), used(false) {};
};

void solve() {
    int n, m;

    cin >> n >> m;
    //cout << n << endl;
    //vector<Deck> bajtekDeck(n);
    vector<Deck> bitekDeck(n);
    //vector<int> bitekWinWith(n, 0);
    //vector<int> bitekLoseWith(n, 0);

    //int bajtekDeckUnused = n;
    //int bitekDeckUnused = n;

    for (int i = 0; i < m; ++i) {
        int a, b;
        char w;

        cin >> a >> w >> b;

        a--; b--;
        if (w == '>') {
            bitekDeck[b].loseWith.push_back(a);
            //bitekLoseWith[b]++;
        }

        if (w == '<') {
            bitekDeck[b].winWith.push_back(a);
            //bitekWinWith[b]++;
        }
    }

    bool foundLose = true;
    bool foundWin  = false;
    for (auto a : bitekDeck) {
        if (a.winWith.size() == 0) {
            foundLose = false;
            break;
        }
    }

    if (foundLose) {
        cout << "PRZEGRANA\n";
        return;
    }
    
    for (auto a : bitekDeck) {
        if (a.loseWith.size() == n) {
            foundWin = true;
            break;
        }
    }

    if (foundWin) {
        cout << "WYGRANA\n";
        return;
    }

    cout << "REMIS\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while ( t-- )
        solve();

    return 0;
}