N,M = map(int,input().split())
Board = [[0] * N for _ in range(N)]
Board[0][0] = 1
Board[N-1][N-1] = 1
from collections import deque
q = deque()
q.append((0,0))
seen = [[False]* N for _ in range(N)]
def check(i,j):
    if 0 <= i < N and 0 <= j < N:
        return True
    else:
        return False
while q:
    i,j= q.popleft()
    seen[i][j] = True
    if i == N-1 and j == N-1:
        print('Yes')
        exit()
    for p,r in [(1,0),(-1,0),(0,-1),(0,1)]:
        if check(i+p,j+r) and not seen[i+p][j+r]:
            if i + p + 1 == N and j + r + 1 == N:
                print('Yes')
                exit()
            print(i+p+1,j+r+1)
            seen[i+p][j+r] = True
            t = input()
            if t == 'Black':
                q.append((i+p,j+r))
print('No')