// http://yukicoder.me/submissions/81063 を参考に、Scannerで再度書いてみる。

import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		try (Scanner sc = new Scanner(System.in)) {
			int h = sc.nextInt();
			int w = sc.nextInt();
			int n = sc.nextInt();
			boolean[] rs = new boolean[n];
			int[] ks = new int[n];

			for (int i = 0; i < n; i++) {
				rs[i] = sc.next().charAt(0) == 'R';
				ks[i] = sc.nextInt();
			}

			int x = 0;
			int y = 0;
			for (int i = n - 1; i >= 0; i--) {
				if (rs[i]) {
					if (ks[i] == y) {
						x = (x - 1 + w) % w;
					}
				} else {
					if (ks[i] == x) {
						y = (y - 1 + h) % h;
					}
				}

				// System.err.println(String.format("%b %d (%d, %d)", rs[i], ks[i], x, y));
			}

			System.out.println((x + y) % 2 == 0 ? "white" : "black");
		}
	}
}