#include <cstdio>
#include <algorithm>

using namespace std;
typedef pair<int,int> ii;

const int MAXN = 200;

int n, cnt, solcnt;
char t;
char mat[MAXN][MAXN];
bool vis[MAXN][MAXN];
int sol[MAXN*MAXN][4];

const int NDX[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int NDY[] = {-1, 1, -2, 2, -2, 2, -1, 1};
const int KDX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int KDY[] = {-1, 0, 1, -1, 1, -1, 0, 1};

bool valid(int x, int y){
    return 0<=x && x<n && 0<=y && y<n && mat[x][y] != '.'; 
}

vector<ii> neighbours(int x, int y){
    vector<ii> res;

    switch(t){
    case 'R':
        for(int i=x+1;i<n;i++) if(mat[i][y] != '.'){ res.push_back(ii(i, y));break;}
        for(int i=x-1;i>=0;i--) if(mat[i][y] != '.'){ res.push_back(ii(i, y));break;}
        for(int i=y+1;i<n;i++) if(mat[x][i] != '.'){ res.push_back(ii(x, i));break;}
        for(int i=y-1;i>=0;i--) if(mat[x][i] != '.'){ res.push_back(ii(x, i));break;}
        break;
    case 'Q':
        for(int i=x+1;i<n;i++) if(mat[i][y] != '.'){ res.push_back(ii(i, y));break;}
        for(int i=x-1;i>=0;i--) if(mat[i][y] != '.'){ res.push_back(ii(i, y));break;}
        for(int i=y+1;i<n;i++) if(mat[x][i] != '.'){ res.push_back(ii(x, i));break;}
        for(int i=y-1;i>=0;i--) if(mat[x][i] != '.'){ res.push_back(ii(x, i));break;}
        for(int i=1;x+i<n && y+i<n;i++) if(mat[x+i][y+i] != '.'){ res.push_back(ii(x+i,y+i)); break;}
        for(int i=1;x+i<n && y-i>=0;i++) if(mat[x+i][y-i] != '.'){ res.push_back(ii(x+i,y-i)); break;}
        for(int i=1;x-i>=0 && y-i>=0;i++) if(mat[x-i][y-i] != '.'){ res.push_back(ii(x-i,y-i)); break;}
        for(int i=1;x-i>=0 && y+i<n;i++) if(mat[x-i][y+i] != '.'){ res.push_back(ii(x-i,y+i)); break;}
        break;
    case 'B':
        for(int i=1;x+i<n && y+i<n;i++) if(mat[x+i][y+i] != '.'){ res.push_back(ii(x+i,y+i)); break;}
        for(int i=1;x+i<n && y-i>=0;i++) if(mat[x+i][y-i] != '.'){ res.push_back(ii(x+i,y-i)); break;}
        for(int i=1;x-i>=0 && y-i>=0;i++) if(mat[x-i][y-i] != '.'){ res.push_back(ii(x-i,y-i)); break;}
        for(int i=1;x-i>=0 && y+i<n;i++) if(mat[x-i][y+i] != '.'){ res.push_back(ii(x-i,y+i)); break;}
        break;
    case 'N':
        for(int i=0;i<8;i++){
            if(valid(x+NDX[i], y+NDY[i])) res.push_back(ii(x+NDX[i], y+NDY[i]));
        }
        break;
    case 'K':
        for(int i=0;i<8;i++){
            if(valid(x+KDX[i], y+KDY[i])) res.push_back(ii(x+KDX[i], y+KDY[i]));
        }
        break;
    }
    return res;
}

void dfs(int x, int y){
    vis[x][y] = true;
    for(const ii& i:neighbours(x, y)){
        int nx=i.first, ny=i.second;
        if(!vis[nx][ny]){
            dfs(nx, ny);
            sol[solcnt][0] = nx; sol[solcnt][1] = ny; 
            sol[solcnt][2] = x; sol[solcnt][3] = y; 
            solcnt++;
        }
    }
}

int main(){
    scanf("%d %c", &n, &t);
    for(int i=0;i<n;i++) scanf("%s", mat[i]);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(mat[i][j] != '.'){
                cnt++;
                dfs(i, j);
            }
        }
    }
    if(solcnt + 1 == cnt){
        puts("YES");
        for(int i=0;i<cnt-1;i++){
            for(int j=0;j<4;j++){
                printf("%d ", sol[i][j]+1);
            }
            puts("");
        }
    }else{
       puts("NO");
    }
}