#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int H, W, N;
    cin >> H >> W >> 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' && K[i] == x && --y < 0) y += W;
        else if(S[i] == 'C' && K[i] == y && --x < 0) x += H;
    }

    cout << ((x + y) % 2 ? "black" : "white") << endl;

    return 0;
}