#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

bool ask(int i, int j) { // 0-indexed
    cout << i+1 << " " << j+1 << endl;
    string res;
    cin >> res;
    if(res == "-1") exit(1);
    return (res == "Black");
}

int main() {
    int N, M;
    cin >> N >> M;

    vector seen(N, vector<bool>(N, false));
    queue<pair<int, int>> que;
    que.emplace(0, 0);
    seen[0][0] = true;

    while(!que.empty()) {
        auto [i, j] = que.front();
        que.pop();

        if(i == N-1 and j == N-1) {
            cout << "Yes\n";
            return 0;
        }

        REP(dir, 4) {
            int ni = i + dy[dir], nj = j + dx[dir];
            if(ni < 0 or ni >= N or nj < 0 or nj >= N or seen[ni][nj]) continue;
            if(ask(ni, nj)) {
                que.emplace(ni, nj);
            }
            seen[ni][nj] = true;
        }
    }
    cout << "No\n";
}