use std::io::{ self, Write };
use std::str::FromStr;
use std::cmp::{ min, max };
use std::collections::{ BinaryHeap, VecDeque };

macro_rules! trace {
    ($var:expr) => ({
        let _ = writeln!(&mut std::io::stderr(), ">>> {} = {:?}", stringify!($var), $var);
    })
}

fn main() {
  let mut sc = Scanner::new();
  let h:i32 = sc.cin();
  let w:i32 = sc.cin();
  let n = sc.cin();

  let mut i = 0;
  let mut j = 0;


  for &(s,k) in (0..n).map(|_| { let s = sc.get_char(); let k = sc.cin(); (s, k) }).collect::<Vec<_>>().iter().rev()
  {
      if s == 'R' {
          if i == k {
              j = (j + w - 1) % w;
          }
      } else {
          if j == k {
              i = (i + h - 1) % h;
          }
      }
  }
  println!("{}", if (i+j)%2==0 { "white" } else { "black" });
}

#[allow(dead_code)]
struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
#[allow(dead_code)]
impl Scanner {
    fn new() -> Scanner { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn reserve(&mut self) {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        self.reserve();
        match self.buffer.pop_front().unwrap().parse::<T>() {
            Ok(a) => a,
            Err(_) => panic!("parse err")
        }
    }
    fn get_char(&mut self) -> char {
        self.reserve();
        let head = self.buffer[0].chars().nth(0).unwrap();
        let tail = String::from( &self.buffer[0][1..] );
        if tail.len()>0 { self.buffer[0]=tail } else { self.buffer.pop_front(); }
        head
    }
}