#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;

#define REP(i,x) for(int i=0;i<(int)(x);i++)

int h, w;
vector<int> hss;
vector<int> wss;

void dump()
{
    for(int y = 0;y < h;y++)
    {
        for(int x = 0;x < w;x++)
        {
            cout << (hss[y]^wss[x]);
        }
        cout << endl;
    }
}

int main(){
    cin >> h >> w;
    ll n;
    cin >> n;
    hss.resize(h);
    wss.resize(w);
    for(int i = 0;i < h;i++)
    {
        hss[i] = i % 2;
    }
    for(int i = 0;i < w;i++)
    {
        wss[i] = i % 2;
    }
    vector<pair<char, int>> vs(n);
    for(ll i = 0;i < n;i++)
    {
        char a;
        int k;
        cin >> a >> k;
        vs[i] = make_pair(a, k);
    }
    int r = 0;
    int c = 0;
    for(ll i = n-1;i >= 0;i--)
    {
        pair<char,int> p = vs[i];
        if(p.first == 'R')
        {
            if(r == p.second)
            {
                c--;
                if(c < 0)
                {
                    c = w-1;
                }
            }
        }
        else
        {
            if(c == p.second)
            {
                r--;
                if(r < 0)
                {
                    r = h - 1;
                }
            }
        }
        //cout << c << "," << r << endl;
    }
    //dump();

    auto color = (hss[r] ^ wss[c]);
    if(color)
    {
        cout << "black" << endl;
        return 0;
    }
    cout << "white" << endl;
    return 0;
    
}