#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  int H, W;
  int N;
  cin >> H >> W;
  cin >> N;
  vector< pair<string,int> > v;
  rep(i,N){
    string s;
    int k;
    cin >> s >> k;
    v.push_back(make_pair(s,k));
  }
  reverse(ALLOF(v));
  int x = 0, y = 0;
  rep(i,N){
    if(v[i].first == "R"){
      if(y == v[i].second){
        x--;
        if(x < 0) x = W-1;
      }
    }else{
      if(x == v[i].second){
        y--;
        if(y < 0) y = H-1;
      }
    }
  }
  if((x+y)%2==1) cout << "black" << endl;
  else cout << "white" << endl;
  
  return 0;
}