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
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#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 MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

using namespace std;

int n, m, a, b;
char slowo[17];
int l[100007], p[100007];

int main()
{
    testy()
    {
        scanf("%d %d", &n, &m);
        forr(i, n+3)
            l[i] = p[i] = 0;
        forr(i, m)
        {
            scanf("%d %s %d", &a, slowo, &b);
            if(slowo[0] == '<')
            {
                l[b]++;
            }
            else
            {
                p[b]++;
            }
        }

        int ile = 0;
        bool jest = 0;
        FOR(i, 1, n)
        {
            if(l[i] > 0)
                ile++;
            if(p[i] == n)
                jest = 1;
        }
        //cout << "ile: " << ile << ", jest: " << jest << endl;
        printf("%s\n", ile == n ? "PRZEGRANA" : (jest ? "WYGRANA" : "REMIS"));
    }

    return 0;
}