from collections import deque
N, M = map(int, input().split())

memo = [-1] * (N * N)
memo[0] = 1
memo[-1] = 1

def chk(x):
    if memo[x] >= 0: return memo[x]
    i, j = x // N, x % N
    print(i + 1, j + 1)
    a = input()
    if a == "Black":
        memo[x] = 1
        return 1
    memo[x] = 0
    return 0
    

def BFS(n):
    Q = deque([0])
    D = [-1] * n
    D[0] = 0
    while Q:
        x = Q.popleft()
        i, j = x // N, x % N
        for di, dj in ((0, 1), (1, 0), (-1, 0), (0, -1)):
            ni, nj = i + di, j + dj
            if not 0 <= ni < N: continue
            if not 0 <= nj < N: continue
            y = ni * N + nj
            if D[y] == -1 and chk(y):
                D[y] = D[x] + 1
                Q.append(y)
    return "Yes" if D[-1] >= 0 else "No"

print(BFS(N * N))