#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int n, m;
int query(int i, int j) {
    cout << i + 1 << ' ' << j + 1 << endl;
    string ret;
    cin >> ret;
    if (ret == "-1") exit(0);
    return ret == "Black";
}

int state[500][500];
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    rep(i, 500) rep(j, 500) state[i][j] = -1;
    state[0][0] = 1;
    cin >> n >> m;
    rep(_, 3000) {
        int d = 1001001001;
        int qi = -1, qj = -1;
        rep(i, n) rep(j, n) if (state[i][j] == -1) {
            int t = n - 1 - i + n - 1 - j;
            if (t >= d) continue;
            bool ok = false;
            rep(k, 4) {
                int ni = i + dx[k], nj = j + dy[k];
                if (!(0 <= ni && ni < n && 0 <= nj && nj < n)) continue;
                if (state[ni][nj] == 1) {
                    ok = true;
                    break;
                }
            }
            if (!ok) continue;
            d = t;
            qi = i, qj = j;
        }
        if (d == 0) {
            cout << "Yes\n";
            return 0;
        }
        state[qi][qj] = query(qi, qj);
    }
    cout << "No\n";
}