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
// VSCF.cpp : Defines the entry point for the console application.
//
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <functional>
#include <cmath>
#include <list>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <sstream>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#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 int long long
#define MAXN 1000010
typedef long double LD;

#undef int
int main() {
#define int long long
	ios_base::sync_with_stdio(0);
	int t;
	cin>>t;
	REP(_, t){
	  int n, m;
	  cin>>n>>m;
	  vector<vector<int>> przegrywa(2);
	  vector<bool> tainted(n);
	  przegrywa[0] = vector<int>(n);
	  przegrywa[1] = vector<int>(n);
	  REP(i, m){
	    int t1, t2;
	    string s;
	    cin>>t1>>s>>t2;
	    t1--;
	    t2--;
	    assert(t1 < n && t2 < n);
	    if(s == ">"){
	      przegrywa[1][t2]++;
	    } else{
	      przegrywa[0][t1]++;
	      tainted[t2] = true;
	    }
	  }
	  REP(i, n){
	    if(przegrywa[1][i] == n){
	      cout<<"WYGRANA\n";
	      goto end;
	    }
	  }
	  REP(i, n){
	    if(!tainted[i]){
	      cout<<"REMIS\n";
	      goto end;
	    }
	  }
	  cout<<"PRZEGRANA\n";
	  end:;
	}
	return 0;
}