def ask(i, j):
    if aa[i][j] != -1: return aa[i][j]
    print(i+1, j+1, flush=True)
    ret = input()
    if ret == "-1": exit()
    aa[i][j] = ret == "Black"
    return aa[i][j]

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
n, m = map(int, input().split())
aa = [[-1]*n for _ in range(n)]
aa[0][0] = aa[n-1][n-1] = 1

cnt = 2
stack = [(0, 0)]
while stack and cnt < m:
    i, j = stack.pop()
    for di, dj in dij:
        ni, nj = i+di, j+dj
        if ni < 0 or nj < 0 or ni >= n or nj >= n: continue
        if aa[ni][nj] != -1: continue
        ret = ask(ni, nj)
        if ret:
            if (ni, nj) == (n-1, n-2) or (ni, nj) == (n-2, n-1):
                print("Yes", flush=True)
                exit()
            stack.append((ni, nj))
            cnt += 1
print("No")