#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
//#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,-1,0,1 };
bool check[1001][1001];
bool used[1001][1001];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	check[0][0] = true;
	used[0][0] = true;
	queue<P> q;
	q.push({ 0,0 });
	while (!q.empty()) {
		int x = q.front().first;
		int y = q.front().second;
		q.pop();
		rep(i, 4) {
			int nx = x + dx[i];
			int ny = y + dy[i];
			if ((0 <= nx) && (n > nx) && (0 <= ny) && (n > ny)) {
				if (check[nx][ny])continue;
				cout << nx + 1 << " " << ny + 1 << endl;
				string s; cin >> s;
				if ("Black" == s) {
					used[nx][ny] = true;
					q.push({ nx,ny });
				}
				check[nx][ny] = true;
			}
		}
	}
	if (used[n - 1][n - 1])cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}