#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int H, W, N;
vector<P> v;

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

    std::cin >> H >> W >> N;

    for(int i=0;i<N;++i){
        string s;
        int x;

        std::cin >> s >> x;

        if(s[0] == 'R'){
            v.emplace_back(x, -1);
        }else{
            v.emplace_back(-1, x);
        }
    }

    reverse(v.begin(), v.end());

    int cur_r = 0, cur_c = 0;
    for(const auto &p : v){
        int r, c;
        tie(r, c) = p;

        if(cur_r == r){
            cur_c = cur_c == 0 ? W - 1 : cur_c - 1;
        }else if(cur_c == c){
            cur_r = cur_r == 0 ? H - 1 : cur_r - 1;
        }
    }

    const string YESNO[2] = {"white", "black"};
    std::cout << YESNO[(cur_c + cur_r) & 1] << std::endl;
}