#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define rrep(i,n,l) for(int i=n-1;i>=l;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a);
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

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];
	}
	int y=0,x=0;
	rrep(i,n,0){
		if(s[i]=="R" && y==k[i]){
			x--;
			if(x==-1) x=w-1;
		}
		if(s[i]=="C" && x==k[i]){
			y--;
			if(y==-1) y=h-1;
		}
	}
	if((int)(x+y)%2) o("black");
	else o("white");
}