#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

def input_wrapper(i, j):
    global query_count

    if Map[i][j] != -1:
        return Map[i][j]
    
    if query_count == 3000:
        return 0
    query_count += 1

    print(i+1, j+1)
    sys.stdout.flush()
    v = input()
    if v == 'Black':
        Map[i][j] = 1
        return 1
    elif v == 'White':
        Map[i][j] = 0
        return 0
    else:
        sys.exit()

def solve(N, M):
    hq = []
    heapq.heappush(hq, ((N-1)+(N-1), 0, 0))
    while hq:
        d, i, j = heapq.heappop(hq)
        for i1, j1 in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:
            if not (0 <= i1 < N and 0 <= j1 < N and Map[i1][j1] == 0):
                continue
            d1 = (N-1-i1) + (N-1-j1)
            v = input_wrapper(i1, j1)
            if v == 1:
                if (i1, j1) == (N-1, N-1):
                    return'Yes'
                heapq.heappush(hq, (d1, i1, j1))
    return 'No'        


N, M = map(int, input().split())
Map = [[-1] * N for _ in range(N)]
Map[0][0] = 1
Map[N-1][N-1] = 1
query_count = 0
print(solve(N, M))
sys.stdout.flush()