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
#include <iostream>
#include <set>
#include <unordered_map>
#include <algorithm>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x<=(e);++x)
#define FORD(x, b, e) for(int x = b; x>=(e);--x)
#define REP(x, n) for(int x = 0; x < (n);++x)
#define VAR(v, n) __typeof(n)v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second

bool tab[100000] = {0};

int main() {
  ios_base::sync_with_stdio(0);

  int t;
  cin >> t;

  for(int i = 0; i < t; i++) {
    int n, m;
    cin >> n >> m;

    for(int j = 0; j < n; j++) tab[j] = 0;

    unordered_map<int, set<int>> ml;
    set<int> sr;

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

      if(w == '>') {
        if(tab[a - 1]) {
          ml[a].insert(b);
        } else {
          set<int> s = {b};
          ml[a] = s;
          tab[a - 1] = 1;
        }
      } else {
        sr.insert(b);
      }
    }

    set<int> resl;

    if(ml.size() == n) {
      resl = ml.begin()->second;
      for(auto const &p : ml) {
        set<int> tmp;
        set_intersection(p.second.begin(), p.second.end(),
                         resl.begin(), resl.end(),
                         inserter(tmp, tmp.begin()));
        resl = tmp;
        if(resl.size() == 0) break;
      }
    }

    if(resl.size() >= 1) {
      cout << "WYGRANA" << endl;
    } else if(sr.size() != n) {
      cout << "REMIS" << endl;
    } else {
      cout << "PRZEGRANA" << endl;
    }
  }

  return 0;
}