#ifdef __GNUC__ #pragma GCC optimize ("O3") #pragma GCC target ("avx") #endif #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include//assert(); #include ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define P(p) cout<<(p)< #define MAIN_INIT std::cin.tie(0); \ std::ios::sync_with_stdio(false);\ std::cout << std::fixed;//小数を10進数表示 ///////// #ifdef getchar_unlocked #define mygc(c) (c)=getchar_unlocked() #else #define mygc(c) (c)=getchar() #endif #ifdef putchar_unlocked #define mypc(c) putchar_unlocked(c) #else #define mypc(c) putchar(c) #endif ///////// typedef long long LL; typedef long double LD; typedef unsigned long long ULL; ///////// using namespace::std; ///////// #ifdef _DEBUG #define DEBUG_BOOL(b) assert(b) #else #define DEBUG_BOOL(b) #endif /////数値読み込み #define ENABLE_READER_ON(T) \ inline void reader(T &x){int k;x = 0;bool flag = true;\ while(true){mygc(k);\ if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\ }\ if( flag ){while(true){mygc(k);if( k<'0' || '9' inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);} // 最小公倍数 template inline T lcm(T a, T b){return a * b / gcd(a, b);} //////////////////////////////// struct MOVE{ string S; int K; }; inline void solve(){ int H,W,N; /*reader(H);reader(W); reader(N);*/ cin >> H >> W >> N; vector move(N); int posW = 0; int posH = 0; for(int i=0;i> move[i].S >> move[i].K; } for(int i=N-1;i>=0;--i){ if( move[i].S[0] == 'R'){ if( posH == move[i].K ){ posW = (posW-1+W)%W; } }else{ if( posW == move[i].K ){ posH = (posH-1+H)%H; } } } if( (posW%2) == (posH%2) ){ cout << "white" << endl; }else{ cout << "black" << endl; } } int main(void){ MAIN_INIT; cout << setprecision(16);//小数をいっぱい表示する。16? solve(); return 0; }