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

#define f first
#define s second

typedef long long int64;
typedef vector <int> VI;
typedef pair <int, int> PII;

const int mod = 1e9 + 7;
const int64 INF = 1000000000000000000LL;

const bool DEBUG = false;
#define DB if(DEBUG)

///////////////////////////////////////






int main() {	
	int t;
  scanf("%d", &t);
  for(int _ = 1; _ <= t; _++) {
    int n, m;
    scanf("%d %d", &n, &m);    
    set <int> S;
    
    vector <vector <int> > lose(n + 1, vector <int>());
    
    
    for(int i = 0; i < m; i++) {
      int a, b;
      char c;
      scanf("%d %c %d", &a, &c, &b);
      if(c == '>') {
        lose[b].push_back(a);
      } else {
        S.insert(b);
      }
    }
    
    bool yes = false;
    for(int i = 1; i <= n; i++) {
      if(lose[i].size() == n) yes = true;
    }
    
    
    if(yes) {
      printf("WYGRANA\n");
    } else if((int)S.size() == n) {
      printf("PRZEGRANA\n");
    } else {
      printf("REMIS\n");
    }
    
    
    
    
  }
	
	
	
	
	
}