#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N, M;
  cin >> N >> M;
  vector<vector<char>> board(N, vector<char>(N, ' '));
  board[0][0] = 'B';
  board[N-1][N-1] = 'B';
  deque<P> que;
  que.push_back(P(0, 0));
  vector<int> dx = {-1, 1, 0, 0};
  vector<int> dy = {0, 0, -1, 1};
  while(!que.empty()) {
    P p = que.front();
    que.pop_front();
    int x = p.first;
    int y = p.second;
    REP(k, 4) {
      int nx = x + dx[k];
      int ny = y + dy[k];
      if(nx < 0 || nx >= N || ny < 0 || ny >= N) continue;
      if(nx == N-1 && ny == N-1) {
        cout << "Yes" << endl;
        return 0;
      }
      if(board[nx][ny] != ' ') continue;
      cout << nx+1 << " " << ny+1 << endl;
      cout.flush();
      string s;
      cin >> s;
      if(s == "Black") {
        board[nx][ny] = 'B';
        que.push_back(P(nx, ny));
      } else {
        board[nx][ny] = 'W';
      }
    }
  }
  cout << "No" << endl;
}