#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

unsigned long xor128() {
	static unsigned long x=123456789, y=362436069, z=521288629, w=88675123;
	unsigned long t=(x^(x<<11));
	x=y; y=z; z=w;
	return (w=(w^(w>>19))^(t^(t>>8)));
}

int main(){
	
	int N,M;
	cin>>N>>M;
	
	assert(M<=1000);
	
	vector f(N,vector<bool>(N,false));
	f[0][0] = true;
	f.back().back() = true;
	
	vector<pair<int,int>> Q;
	Q.emplace_back(0,0);
	vector ff(N,vector<bool>(N,false));
	ff[0][0] = true;
	int cnt = 0;
	while(Q.size()>0){
		int ind = xor128()%Q.size();
		int y = Q[ind].first,x = Q[ind].second;
		Q.erase(Q.begin()+ind);
		
		rep(i,2){
			int yy = y+i,xx = x+(i^1);
			if(yy==N-1&&xx==N-1){
				cout<<"Yes"<<endl;
				return 0;
			}
			if(yy>=N||xx>=N)continue;
			if(ff[yy][xx])continue;
			ff[yy][xx] = true;
			assert(cnt!=3000);
			cnt++;
			cout<<yy+1<<' '<<xx+1<<endl;
			
			string ret;
			cin>>ret;
			assert(ret!="-1");
			if(ret=="Black"){
				f[yy][xx] = true;
				Q.emplace_back(yy,xx);
			}
		}
		
	}
	
	cout<<"No"<<endl;
	
	return 0;
}