#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>

#define MP(x, y) make_pair(x, y)
#define pii pair <int, int>

using namespace std;

int read() {
    int x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9') {
        if(c == '-') f = -1;
        c = getchar();
    }
    while('0' <= c && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * f;
}

#define Maxn 105
int n, tot;
pii ans[Maxn * Maxn], fa[Maxn][Maxn];
char exca, grid[Maxn][Maxn];

bool vis[Maxn][Maxn];

bool check(int x, int y) {
    if(1 <= x && x <= n && 1 <= y && y <= n && !vis[x][y] && grid[x][y] == exca) return 1;
    else return 0;
}

int Kx[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int Ky[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int Nx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int Ny[8] = {1, -1, 2, -2, 2, -2, 1, -1};

void dfs(int x, int y, int fx, int fy) {
    // cerr << "cur log " << x << " " << y << " " << fx << " " << fy << endl;
    vis[x][y] = 1;
    fa[x][y] = MP(fx, fy);
    if(exca == 'K') {
        for(int i = 0; i < 8; ++i) {
            int nx = x + Kx[i], ny = y + Ky[i];
            if(check(nx, ny)) dfs(nx, ny, x, y);
        }
    }
    if(exca == 'N') {
        for(int i = 0; i < 8; ++i) {
            int nx = x + Nx[i], ny = y + Ny[i];
            if(check(nx, ny)) dfs(nx, ny, x, y);
        }
    }
    if(exca == 'R' || exca == 'Q') {
        for(int nx = 1; nx <= n; ++nx) {
            if(nx == x) continue;
            if(check(nx, y)) dfs(nx, y, x, y);
        }
        for(int ny = 1; ny <= n; ++ny) {
            if(ny == y) continue;
            if(check(x, ny)) dfs(x, ny, x, y);
        }
    }
    if(exca == 'B' || exca == 'Q') {
        for(int nx = 1; nx <= n; ++nx) {
            int ny = x + y - nx;
            if(nx == x && ny == y) continue;
            if(check(nx, ny)) dfs(nx, ny, x, y);
        }
        for(int nx = 1; nx <= n; ++nx) {
            int ny = y - x + nx;
            if(nx == x && ny == y) continue;
            if(check(nx, ny)) dfs(nx, ny, x, y);
        }
    }
    ans[++tot] = MP(x, y);
}

int main() {
    n = read(); exca = getchar();
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            cin >> grid[i][j];
    int bk = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j)
            if(grid[i][j] == exca) {
                dfs(i, j, 0, 0);
                bk = 1;
                break;
            }
        if(bk) break;
    }
    bool flag = 1;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) {
            if(grid[i][j] == exca && !vis[i][j]) {
                flag = 0; break;
            }
        }
    if(!flag) {
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    for(int i = 1; i <= tot; ++i) {
        int x = ans[i].first, y = ans[i].second, fx = fa[x][y].first, fy = fa[x][y].second;
        if(fx && fy) printf("%d %d %d %d\n", x, y, fx, fy);
    }
    return 0;
}