#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
#include <numeric>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,Nof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mdi;


int main(){
	int h,w,n;
	cin >> h >> w >> n;
	vector<char> s(n);
	vector<int> v(n);
	
	for(int i=0;i<n;i++) cin >> s[i] >> v[i];
	
	int x=0,y=0;
	for(int i=n-1;i>=0;i--){
		if(s[i]=='R'){
			if(y==v[i]) x=(x+w-1)%w;
		}
		else{
			if(x==v[i]) y=(y+h-1)%h;
		}
	}
	
	if((y+x)%2==0)
		cout << "while" << endl;
	else
		cout << "black" << endl;
	return 0;
}