#include using namespace std; using ll = long long; using ld = long double; // -------------------------------------------------------- template bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; } #define FOR(i,l,r) for (ll i = (l); i < (r); ++i) #define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define ALL(c) (c).begin(), (c).end() #define RALL(c) (c).rbegin(), (c).rend() #define SORT(c) sort(ALL(c)) #define RSORT(c) sort(RALL(c)) #define MIN(c) *min_element(ALL(c)) #define MAX(c) *max_element(ALL(c)) #define SUMLL(c) accumulate(ALL(c), 0LL) #define COUNT(c,v) count(ALL(c),(v)) #define SZ(c) ((ll)(c).size()) #define BIT(b,i) (((b)>>(i)) & 1) #define PCNT(b) __builtin_popcountll(b) #define CIN(c) cin >> (c) #define COUT(c) cout << (c) << '\n' #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n' ll llceil(ll a, ll b) { return (a + b - 1) / b; } ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); } string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; } string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; } template void cout_line(const vector& ans, ll l, ll r) { for (ll i = l; i < r; i++) { if (i != l) { cout << " "; } cout << ans[i]; } cout << '\n'; } template void debug_line(const vector& ans, ll l, ll r, ll L = 0) { cerr << "l." << L << " :"; for (ll i = l; i < r; i++) { cerr << " " << ans[i]; } cerr << '\n'; } using P = pair; using VP = vector

; using VVP = vector; using VS = vector; using VVS = vector; using VLL = vector; using VVLL = vector; using VVVLL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VLD = vector; using VVLD = vector; using VVVLD = vector; static const double EPS = 1e-10; static const double PI = acos(-1.0); static const ll MOD = 1000000007; // static const ll MOD = 998244353; static const ll INF = (1LL << 62) - 1; // 4611686018427387904 - 1 // -------------------------------------------------------- // #include // using namespace atcoder; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); ll N, M; cin >> N >> M; ll H = N, W = N; VVLL S(H, VLL(W,-1)); S[0][0] = S[H-1][W-1] = 1; ll Q = 3000; auto masu = [&](ll h, ll w) -> bool { if (S[h][w] >= 0) { return S[h][w] == 1; } if (Q == 0) return false; Q--; cout << h+1 << " " << w+1 << endl; string T; cin >> T; if (T == "-1") exit(0); return (S[h][w] = (T == "Black")); }; VLL dh = {-1,1,0,0}; VLL dw = {0,0,-1,1}; auto dfs = [&](auto self, ll h, ll w, ll ph, ll pw) -> void { // cerr << "cur = " << h+1 << " " << w+1 << endl; REP(i,4) { ll hh = h + dh[i]; ll ww = w + dw[i]; if (hh < 0 || H <= hh || ww < 0 || W <= ww) continue; if (hh == ph && ww == pw) continue; if (hh == H-1 && ww == W-1) { COUT("Yes"); exit(0); } if (masu(hh, ww)) { self(self, hh, ww, h, w); } } }; dfs(dfs, 0, 0, -1, -1); COUT("No"); return 0; }