#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll inf = 1LL << 50;
const ll MOD = 1e9 + 7;
struct edge { ll from; ll to; ll cost; };




int main(){
	int h, w ,n;
	cin >> h >> w >> n;
	vector<string>s(n);
	vector<int>k(n);
	rep(i, 0, n) {
		cin >> s[i] >> k[i];
	}
	reverse(all(s)), reverse(all(k));


	int x = 0;
	int y = 0;
	rep(i, 0, n) {
		if (s[i] == "R" && k[i] == x) {
			if (y >= 1) y-= 1;
			else y = w - 1;
		}
		else if (s[i] == "C" && k[i] == y){
			if (x >= 1) x -= 1;
			else x = h - 1;
		}
	}

	if ((x + y) % 2 == 0) {
		cout << "white" << endl;
	}
	else {
		cout << "black" << endl;
	}

	return 0;
}