import sys
sys.setrecursionlimit(2000)
N,M = map(int,input().split())
S0 = [[1] * (N+2)]
S = S0 + [([1] + [0] * N + [1]) for _ in range(N)] + S0
D = [[0,1],[1,0],[0,-1],[-1,0]]

def dfs(x,y):
    if x == N and y == N:
        print("Yes")
        sys.exit()
    for d in D:
        a,b = d
        x1 = x + a
        y1 = y + b
        if S[x1][y1] == 0:
            S[x1][y1] = 1
            print(x1,y1)
            res = input()
            if res == "-1":
                sys.exit()
            elif res == "Black":
                dfs(x1,y1)
    
    
S[1][1] = 1
dfs(1,1)
print("No")
sys.exit()