#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define quit(a) {cout << a << endl; return 0;}
using ll = long long;
using P = pair<int,int>;
// using mint = modint998244353;
// using mint = modint1000000007;
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1001001001;
const ll LINF = 1002003004005006007ll;


int main() {
  int n, m;
  cin >> n >> m;
  vector g(n,vector<bool>(n,false));
  g[0][0] = true;
  queue<P> q;
  q.push({0,0});
  int di[4] = {0,1,0,-1};
  int dj[4] = {1,0,-1,0};
  while (!q.empty()){
    auto [i,j] = q.front(); q.pop();
    if (i == n-1 && j == n-1) quit("Yes");
    rep(d,4){
      int ni = i + di[d];
      int nj = j + dj[d];
      if ((ni < 0) || (ni >= n) || (nj < 0) || (nj >= n)) continue;
      if (g[ni][nj]) continue;
      printf("%d %d\n",ni+1,nj+1);
      string s;
      cin >> s;
      if (s == "Black") q.push({ni,nj}), g[ni][nj] = true;
    }
  }
  cout << "No" << endl;
  return 0;
}