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
#include<bits/stdc++.h>
using namespace std;
# ifdef DEB
# define debug(...) fprintf(stderr, __VA_ARGS__)
# else
# define debug(...)
#endif
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define LL long long
#define LD long double
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define pb pop_back
#define VI vector<int> 
#define VPI vector<PII> 
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define FORD(i,a,b) for(int i = (a); i >= (b); i--)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define ALL(x) (x).begin(), (x).end()
#define siz(V) ((int)V.size())

int n, m;
int in[100005], out[100005];
char C[10];

void solve()
{
  scanf("%d%d", &n, &m);
  RE(i, n)
  {
    out[i]=0;
    in[i]=0;
  }
  bool worseall=false;
  int haveout=0;
  RE(i, m)
  {
    int a, b;
    scanf("%d%s%d", &a, C, &b);
    if(C[0]=='<')
    {
      out[b]++;
      if(out[b]==1)
        haveout++;
    }
    else
    {
      in[b]++;
      if(in[b]==n)
        worseall=true;
    }
  }
  if(worseall)
    printf("WYGRANA\n");
  else
  {
    if(haveout==n)
      printf("PRZEGRANA\n");
    else
      printf("REMIS\n");
  }
}

int main()
{
  //ios_base::sync_with_stdio(0);
  int t;
  scanf("%d", &t);
  while(t--)
    solve();
	return 0;
}