#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 1234560
#endif

int N,H,W;
char S[SIZE];
int K[SIZE];

void solve() {
    cin>>H>>W>>N;
    REP(i,N)cin>>S[i]>>K[i];
    int x=0,y=0;
    RREP(i,N) {
        if (S[i]=='R') {
            if (x==K[i]) {
                y += W - 1;
                y %= W;
            }
        }
        if (S[i]=='C') {
            if (y==K[i]) {
                x += H - 1;
                x %= H;
            }
        }
    }
    
    cout << ((x+y) % 2 ? "black" : "white") << endl;
}