#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<cassert>
int cnt = 0;
int ask(int i,int j){
    if(cnt==3000){
        cout<<"No"<<endl;
        exit(0);
    }
    cout<<i+1<<" "<<j+1<<endl;
    string s;
    cin>>s;
    assert(s!="-1");
    if(s=="Black") return 1;
    return 0;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> que;
    que.push_back(make_pair(0,0));
    vector<vector<int>> vis(n,vector<int>(n,0));
    vis[0][0] = 1;
    int dx[] = {1,-1,0,0};
    int dy[] = {0,0,1,-1};
    for(int i = 0;i<que.size();i++){
        auto now = que[i];
        int ni = now.first;
        int nj = now.second;
        for(int k = 0;k<4;k++){
            int nni = ni + dx[k];
            int nnj = nj + dy[k];
            if(nni<0||nni>=n||nnj<0||nnj>=n) continue;
            if(vis[nni][nnj]!=0) continue;
            vis[nni][nnj] = -1;
            int p = ask(nni,nnj);
            if(p==1){
                vis[nni][nnj] = 1;
                que.push_back(make_pair(nni,nnj));
                if(nni==n-1&&nnj==n-1){
                    cout<<"Yes"<<endl;
                    return 0;
                }
            }
        }
    }
    cout<<"No"<<endl;

}