#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

char s[1000100];
int k[1000010];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int H, W;
    cin >> H >> W;
    int N;
    cin >> N;
    int r = 0, c = 0;
    for (int i = 0; i < N; i++) {
        cin >> s[i] >> k[i];
    }
    for (int i = N-1; i >= 0; i--) {
        if (s[i] == 'R') {
            if (k[i] == r) c = (c+W-1)%W;
        } else {
            if (k[i] == c) r = (r+H-1)%H;
        }
    }
    if ((r+c)%2) cout << "black" << endl;
    else cout << "white" << endl;
    return 0;
}