#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll H, W;
    cin >> H >> W;

    ll N;
    cin >> N;

    vector<char> S(N);
    vector<ll> K(N);
    FOR(i, 0, N){
        cin >> S.at(i);
        cin >> K.at(i);
    }

    ll i = 0; // たて
    ll j = 0; // よこ
    for(int q=N-1; q>=0; q--){
        char c = S[q];
        ll index = K[q];

        if(c=='R' && index==i){
            j--;
            if(j<0) j+=W;
        }
        else if(c=='C' && index==j){
            i--;
            if(i<0) i+=H;
        }
    }

    if((i+j)%2==0){
        p("white");
    }else{
        p("black");
    }
    
    return 0;
}