#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    vector< pair<int,int> > Q;
    int H,W,N;
    cin >> H >> W >> N;
    
    for ( int i = 0; i < N; i++ ) {
        string S;
        int K;
        cin >> S >> K;
        Q.push_back( make_pair( S == "R" ? 1 : 0, K ) );
    }
    int r = 0, c = 0;
    for ( int i = N-1; i >= 0; i-- ) {
        
        
        // cout << r << endl;
        // cout << c << endl;
        
        if ( (Q[i].first ? r : c)  == Q[i].second ) {
            if ( Q[i].first ) {
                c = (c+(W-1))%W;
            } 
            else {
                r = (r+(H-1))%H;
            }
        }
        
    }
    
    cout << ( (r+c)%2 ? "black" : "white" ) << endl;
    
    
    return 0;
}