#include #include using namespace std; using namespace atcoder; //#pragma GCC optimize("Ofast") #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() using ll = long long; using vec = vector; using mat = vector; ll N,M,H,W,Q,K,A,B; string S; using P = pair; using tp = tuple; const ll INF = (1LL<<60); template bool chmin(T &a, const T b){ if(a > b) {a = b; return true;} else return false; } template bool chmax(T &a, const T b){ if(a < b) {a = b; return true;} else return false; } template void my_printv(std::vector v,bool endline = true){ if(!v.empty()){ for(std::size_t i{}; i>s; if(s == "-1") exit(1); return s == "White"; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cin>>N>>M; const vector di = {-1, 0, 1, 0}, dj = {0, -1, 0, 1}; mat G(N, vec(N, -1)); G[0][0] = 0; auto dfs = [&](auto &&self, int i, int j) -> void{ if(i == N - 1 && j == N - 1) yn(true); rep(k, 4){ int ni = i + di[k], nj = j + dj[k]; if(ni >= 0 && ni < N && nj >= 0 && nj < N){ if(G[ni][nj] == -1){ G[ni][nj] = ask_white(ni, nj); if(G[ni][nj] == 0) self(self, ni, nj); } } } }; dfs(dfs, 0, 0); yn(false); }