import sys
import math
from collections import deque,Counter
#sys.setrecursionlimit(10**7)
int1=lambda x: int(x)-1

mi=lambda :map(int,input().split())
li=lambda :list(mi())
mi1=lambda :map(int1,input().split())
li1=lambda :list(mi1())
mis=lambda :map(str,input().split())
lis=lambda :list(mis())

from collections import defaultdict
"""
d=defaultdict(int) #初期値 0
d=defaultdict(lambda:1) #初期値 1
"""

mod=10**9+7
Mod=998244353
INF=10**18
ans=0

n,m=mi()
Map=[[-1]*n for i in range(n)]
Map[0][0]=1
d=deque()
d.append([0,0])
dxdy=[[0,1],[0,-1],[1,0],[-1,0]]
while d:
  x,y=d.pop()
  for dx,dy in dxdy:
    if 0<=x+dx<n and 0<=y+dy<n:
      if Map[x+dx][y+dy]==-1:
        print(x+dx+1,y+dy+1)
        s=input()
        if s=='Black':
          Map[x+dx][y+dy]=1
          d.append([x+dx,y+dy])
          if x+dx==n-1 and y+dy==n-1:
            print('Yes')
            exit()
        else:
          Map[x+dx][y+dy]=0
print('No')