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
import java.util.Scanner;

/**
 * Created by dominik on 22.11.2016.
 */
public class kar {

    public static final String FAIL = "PRZEGRANA";
    public static final String SUCCESS = "WYGRANA";
    public static final String DRAW = "REMIS";


    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        for(int i=0;i<t;i++) {
            int n = scanner.nextInt();
            int m = scanner.nextInt();

            int [] decksA = new int[n];
            int [] decksB = new int[n];


            for(int k=0;k<m;k++) {
                int a = Integer.parseInt(scanner.next());
                String w = scanner.next();
                int b = Integer.parseInt(scanner.next());

                if( ">".equals(w)) {
                    decksA[a-1]++;
                } else {
                    decksB[b-1]++;
                }
            }
            int mina = min(decksA);
            int minb = min(decksB);

            if(mina==minb){
                System.out.println(DRAW);
            }else if(mina > minb) {
                System.out.println(SUCCESS);
            } else {
                System.out.println(FAIL);
            }

        }
    }

    private static int min(int [] decks) {
        int min = decks[0];
        for(int i=1;i<decks.length;i++){
            min = Math.min(min, decks[i]);
        }
        return min;
    }


}