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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))

#define MAX_N 100009
vector<char> edge_to_left_in_right(MAX_N);
vector<int>  left_count_in_right  (MAX_N);

int main() {
    int t;
    scanf("%d", &t);
    REP(tt, t) {
        int n, m;
        scanf("%d%d", &n, &m);
        fill_n(edge_to_left_in_right.begin(), n, 0);
        fill_n(left_count_in_right.begin(), n, 0);
        REP(i,m) {
            int a, b;
            char w;
            scanf("%d %c %d", &a, &w, &b);
            --a;
            --b;

            if (w == '<') {
                edge_to_left_in_right[b] = 1;
            } else {
                ++left_count_in_right[b];
            }
        }
        int rights_with_edges_to_left_count = count(edge_to_left_in_right.begin(), edge_to_left_in_right.begin()+n, 1);
        if (rights_with_edges_to_left_count == n) {
            printf("PRZEGRANA\n");
        } else {
            auto last = left_count_in_right.begin()+n;
            if (find(left_count_in_right.begin(), last, n) != last) {
                printf("WYGRANA\n");
            } else {
                printf("REMIS\n");
            }
        }
    }

    return 0;
}