#include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
#define times(n, i) for (int i = 0; i < n; i++)
#define range(n, m, i) for (int i = n; i < m; i++)
#define upto(n, m, i) for (int i = n; i <= m; i++)
#define downto(n, m, i) for (int i = n; i >= m; i--)
#define foreach(xs, x) for (auto &x : xs)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) erase(unique(all(xs)), (xs).end())
int64 mod10e9_7 = 1000000007;

int main()
{
    int h, w, n;
    cin >> h >> w >> n;
    vector<int> d(h);
    times(h, y) {
        d[y] = 0;
        for (int i = (y + ((w+1)%2))%2; i < w; i += 2) {
            d[y] += 1 << i;
        }
    }
    times(n, i) {
        char c; int v;
        cin >> c >> v;
        if (c == 'R') {
            int b = d[v] & 1;
            d[v] >>= 1;
            d[v] += (b << (w-1));
        }
        else {
            v = w-1 - v;
            int b = (d[h-1] >> v) & 1;
            downto(h-1, 1, y) {
                if ((d[y] >> v) & 1 == 1)
                    d[y] -= (1 << v);
                d[y] += d[y-1] & (1 << v);
            }
            if ((d[0] >> v) & 1 == 1)
                d[0] -= (1 << v);
            d[0] += (b << v);
        }
    }
    cout << ((d[0] & (1 << (w-1))) == 0 ? "black" : "white") << endl;
    return 0;
}