#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h,w; cin >> h >> w;
    int n; cin >> n;
    vector<char> s(n);
    vector<int> k(n);
    for(int i=0;i<n;i++){
        cin >> s[i] >> k[i];
    }
    int x = 0, y = 0;
    for(int i=n-1;i>=0;i--){
        if(s[i] == 'R'){
            if(k[i] == x){
                y--;
                if(y == -1)y = w-1;
            }
        }
        else{
            if(k[i] == y){
                x--;
                if(x == -1)x = h-1;
            }
        }
    }
    if((x+y)%2 == 0){
        cout << "white" << endl;
    }
    else{
        cout << "black" << endl;
    }
}