#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("white");}else{puts("black");} #define MAX_N 200005 int main() { int h, w; cin >> h >> w; int n; cin >> n; char c[n], k[n]; rep(i,n)cin >> c[i] >> k[i]; int x = 0, y = 0; drep(i,n){ if(c[i] == 'R' && k[i] == x){ if(y == 0){ y = w - 1; }else{ y--; } } if(c[i] == 'C' && k[i] == y){ if(x == 0){ x = h - 1; }else{ x--; } } } if((x+y)%2==0)yn; return 0; }