#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int h, w;

void f(pair<int,int>& p, int n) {
    char s;
    int k;
    cin >> s >> k;
    if (n > 0)
        f(p,n-1);
    if (s == 'R' && k == p.first)
        p.second = (p.second + w - 1) % w;
    else if (s == 'C' && k == p.second)
        p.first = (p.first + h - 1) % h;
}

int main() {
    int n;
    pair<int,int> p {0,0};
    cin >> h >> w >> n;
    f(p,n);
    if ((p.first + p.second) % 2 == 0)
        cout << "white" << endl;
    else
        cout << "black" << endl;
    return 0;
}