#include <iostream>
#include <vector>
#include <deque>
#include <unordered_map>
#include <map>
#include <string>

using namespace std;
using ll = long long;


int n;
char type;
vector<vector<bool>> exc;
vector<pair<int, int>> pos;

bool in(int x, int y){
    return (0 <= x && x < n && 0 <= y && y < n) && exc[x][y];
}

void neigh(int x, int y, vector<pair<int, int>>& out){
    if(type == 'K'){
        vector<int> dx = {-1, 0, 1, 1, 1, 0, -1, -1};
        vector<int> dy = {-1, -1, -1, 0, 1, 1, 1, 0};
        for(int i = 0; i < 8; ++i){
            if(in(x+dx[i], y+dy[i])) out.push_back({x+dx[i], y+dy[i]});
        }
        return;
    }else if(type == 'N'){
        vector<int> dx = {-2, -1, 1, 2, 2, 1, -1, -2};
        vector<int> dy = {-1, -2, -2, -1, 1, 2, 2, 1};
        for(int i = 0; i < 8; ++i){
            if(in(x+dx[i], y+dy[i])) out.push_back({x+dx[i], y+dy[i]});
        }
        return;
    }
    if(type == 'R' || type == 'Q'){
        for(int i = 0; i < n; ++i){
            if(i != y && in(x, i)) out.push_back({x, i});
            if(i != x && in(i, y)) out.push_back({i, y});
        }
    }
    if(type == 'B' || type == 'Q'){
        for(int i = 0; i < n; ++i){
            if((i != x || y + (i-x) != y) && in(i, y + (i-x))) out.push_back({i, y + (i-x)});
            if((i != x || y - (i-x) != y) && in(i, y - (i-x))) out.push_back({i, y - (i-x)});
        }
    }
}

vector<vector<bool>> visited;
vector<vector<pair<int, int>>> parent;
vector<pair<int, int>> post;

void explore(int x, int y){
    //printf("exploring %d %d, parent %d %d\n", x, y, parent[x][y].first, parent[x][y].second);
    visited[x][y] = true;
    vector<pair<int, int>> n;
    neigh(x, y, n);
    for(pair<int, int> p : n){
        if(!visited[p.first][p.second]){
            parent[p.first][p.second] = {x, y};
            explore(p.first, p.second);
        }
    }
    post.push_back({x, y});
}

bool dfs(){
    visited.assign(n, vector<bool>(n, false));
    parent.assign(n, vector<pair<int, int>>(n, {-1, -1}));
    int comp = 0;
    for(pair<int, int> p : pos){
        if(!visited[p.first][p.second]){
            comp++;
            explore(p.first, p.second);
        }
    }
    return comp == 1;
}

int main(){
    char c;
    scanf("%d %c", &n, &type);
    string str;
    int count = 0;
    exc.assign(n, vector<bool>(n, false));
    vector<vector<int>> row(n, vector<int>()), col(n, vector<int>()), dl(2*n, vector<int>()), ds(2*n, vector<int>());
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            scanf(" %c", &c);
            //printf("char %c scanned\n", c);
            if(c == type){
                exc[i][j] = true;
                pos.push_back({i, j});
                count++;
            }
        }
    }
    if(!dfs()){
        printf("NO");
        return 0;
    }
    printf("YES");
    int num = post.size();
    for(int i = 0; i < num-1; ++i){
        pair<int, int>& p = post[i];
        pair<int, int>& par = parent[p.first][p.second];
        printf("\n%d %d %d %d", p.first + 1, p.second + 1, par.first + 1, par.second + 1);
    }
}