# ゴールから逆順に[0,0]がどこに移っていくか見ればいい

H, W = map(int, input().split())
N = int(input())
SK = []
for i in range(N):
    s, k = map(str, input().split())
    k = int(k)
    SK.append([s, k])
SK = SK[::-1]
#print(SK)

current_r, current_c = 0, 0
for i in range(N):
    s, k = SK[i]
    if s == 'R':
        if current_r == k:
            current_c = (current_c-1)%W
    elif s == 'C':
        if current_c == k:
            current_r = (current_r-1)%H
    #print(current_r, current_c)
        
if (current_r+current_c)%2 == 0:
    print('white')
else:
    print('black')