import java.io.*; import java.util.*; class Main { public static void main(String args[])throws Exception { BufferedReader bu=new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb=new StringBuilder(); String s[]=bu.readLine().split(" "); int n=Integer.parseInt(s[0]),m=Integer.parseInt(s[1])-2; boolean b[][]=new boolean[n+1][n+1]; b[1][1]=b[n][n]=true; int di[][]={{-1,0},{0,1},{1,0},{0,-1}}; boolean vis[][]=new boolean[n+1][n+1],ask[][]=new boolean[n+1][n+1]; vis[1][1]=true; Queue q=new LinkedList<>(); q.add(new Pair(1,1)); while(!q.isEmpty() && m>0) { Pair p=q.poll(); for(int d[]:di) { int tx=p.x+d[0],ty=p.y+d[1]; if(tx>0 && tx<=n && ty>0 && ty<=n && !vis[tx][ty]) { if(b[tx][ty]) { q.add(new Pair(tx,ty)); vis[tx][ty]=true; } else if(!ask[tx][ty] && m>0) { System.out.print(tx+" "+ty+"\n"); System.out.flush(); String ver=bu.readLine(); if(ver.charAt(0)=='-') return; if(ver.charAt(0)=='B') { q.add(new Pair(tx,ty)); b[tx][ty]=true; vis[tx][ty]=true; m--; } ask[tx][ty]=true; } } } } if(vis[n][n]) sb.append("Yes\n"); else sb.append("No\n"); System.out.print(sb); System.out.flush(); return; } static class Pair { int x,y; Pair(int a,int b) { x=a; y=b; } } }