import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int H, W;
int N;
string[] S;
int[] K;

void main() {
  try {
    for (; ; ) {
      H = readInt();
      W = readInt();
      N = readInt();
      S = new string[N];
      K = new int[N];
      foreach (i; 0 .. N) {
        S[i] = readToken();
        K[i] = readInt();
      }
      
      int x = 0, y = 0;
      foreach_reverse (i; 0 .. N) {
        switch (S[i]) {
          case "R": {
            if (x == K[i]) {
              y = (y + W - 1) % W;
            }
          } break;
          case "C": {
            if (y == K[i]) {
              x = (x + H - 1) % H;
            }
          } break;
          default: assert(false);
        }
      }
      writeln(["white", "black"][(x + y) % 2]);
    }
  } catch (EOFException e) {
  }
}