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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <algorithm>
#include <iostream>
#include <cassert>
#include <vector>
#include <cstdio>
#include <array>
#include <deque>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
namespace {
	using namespace std;

	typedef vector<int> vint;
	typedef long long unsigned ulo;
	typedef long long lint;
	
	void __attribute__((unused)) spacje(int k) {
		int magic;
		static stack<int*> stos;
		while (!stos.empty() && stos.top() <= &magic) stos.pop();
		stos.push(&magic);
		for (int n = k * stos.size(); n--;) fprintf(stderr, " ");
	}
	
	#define BOTH(x) for (int x = 0; x < 2; ++x)
	
	#define UPlt(xx, yy) (xx) = min(xx, yy)
	#define UPgt(xx, yy) (xx) = max(xx, yy)
	
	struct in_t {
		template<class T>
		operator T () {
			static bool __attribute__((unused)) dummy = ios_base::sync_with_stdio(false);
			T x;
			cin >> x;
			return x;
		}
	};
	in_t __attribute__((unused)) in;
	
	class Print {
		ostream & os;
		bool nfirst;
	 public:
		Print(ostream & os = cout) : os(os), nfirst(false) {}
		~Print() { os << endl; }
		template<class T> Print & operator , (T const& e) {
			if (nfirst) os << " ";
            os << e; nfirst = true; return *this; 
        }
	};
	
	#define print Print{cout},
	#define prerr Print{cerr},
	
	template <class T>
	struct Range {
		struct Intit {
			T x; Intit(T x) : x(x) {}
			T & operator * () { return x; };
			bool operator != (Intit other) { return x < other.x; }
			void operator ++ () { ++x; }
		};
		
		T b, e;
		explicit Range(T n) : b(0), e(n) {}
		Range(T b, T e) : b(b), e(e) {}
		Intit begin() { return b; }
		Intit end() { return e; }
	};
	
	template <class T>
	Range<T> range(T n) { return Range<T>(n); }
	
	template <class T>
	Range<T> range(T b, T e) { return Range<T>(b, e); }

	template <class T>
	Range<T> inclusive(T b, T e) { return Range<T>(b, e + 1); }
	
	#define _ __attribute__((unused)) _
};

#define dprintf(...) if (1) spacje(2), fprintf(stderr, __VA_ARGS__)

int main() {
    for (int _ : range(int(in))) {
        int n = in;
        int m = in;
        vector<int> bajtek(n), bitek(n);
        while (m--) {
            char c;
            do { c = in; } while ( c != '<' && c != '>' );
            int b = in;
            b--;
            if (c == '<') {
                bitek[b]++;
            }
            if (c == '>') {
                bajtek[b]++;
            }
        }

        bool bajwyg = false;
        for (int x : bajtek) { if (x == n) bajwyg = true; }

        bool biwyg = true;
        for (int x : bitek) { if (x == 0) biwyg = false; }

        if (bajwyg) { print "WYGRANA"; }
        else if (biwyg) { print "PRZEGRANA"; }
        else { print "REMIS"; }
    }
}