#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

char s[1000010];
int k[1000010];

int main()
{
	ll H,W,N;
	cin >> H >> W >> N;

	for (int i = 0; i < N; i++)
		cin >> s[i] >> k[i];
	
	int r = 0, c = 0;
	for (int i =N-1; i >= 0; i--) {
		if (s[i] == 'R' && k[i] == r) {
			c = (c + W - 1) % W;
		}else if(s[i] == 'C' && k[i] == c){
			r = (r + H - 1) % H;
		}
	}
	if ((r + c) % 2 == 0)
		cout << "white" << endl;
	else
		cout << "black" << endl;
	
	return 0;
}