#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <cstring>
#include <vector>
#include <bitset>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 100;

int id[N + 5][N + 5], fa[N * N + 5];
char s[N + 5][N + 5];
std::vector<int> Vec[N * N + 5];
int dx1[8] = {-2, -2, -1, 1, 2, 2, 1, -1}, dy1[8] = {-1, 1, 2, 2, 1, -1, -2, -2};
int dx2[8] = {-1, -1, -1, 0, 1, 1, 1, 0}, dy2[8] = {-1, 0, 1, 1, 1, 0, -1, -1};

struct Node {
    int x, y;
};
Node a[N * N + 5];

int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int u, int v) {
    int fu = find(u), fv = find(v);
    if (fu == fv) return;
    Vec[u].push_back(v), Vec[v].push_back(u);
    fa[fu] = fv;
}

void dfs(int u, int ff) {
    for (int v : Vec[u]) {
        if (v == ff) continue;
        dfs(v, u);
        printf("%d %d %d %d\n", a[v].x, a[v].y, a[u].x, a[u].y);
    }
}

int main() {
    int n;
    read(n);
    std::string typ;
    std::cin >> typ;
    int m = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%s", s[i] + 1);
        for (int j = 1; j <= n; ++j) {
            if (s[i][j] == '.') continue;
            a[++m] = (Node) {i, j};
            id[i][j] = m;
        }
    }
    for (int i = 1; i <= m; ++i) fa[i] = i;
    for (int i = 1; i <= m; ++i) {
        int x = a[i].x, y = a[i].y;
        if (typ == "R" || typ == "Q") {
            for (int j = y - 1; j; --j) {
                if (id[x][j]) {
                    merge(i, id[x][j]);
                    break;
                }
            }
            for (int j = y + 1; j <= n; ++j) {
                if (id[x][j]) {
                    merge(i, id[x][j]);
                    break;
                }
            }
            for (int j = x - 1; j; --j) {
                if (id[j][y]) {
                    merge(i, id[j][y]);
                    break;
                }
            }
            for (int j = x + 1; j <= n; ++j) {
                if (id[j][y]) {
                    merge(i, id[j][y]);
                    break;
                }
            }
        }
        if (typ == "B" || typ == "Q") {
            for (int ii = x - 1, jj = y - 1; ii && jj && ii <= n && jj <= n; --ii, --jj) {
                if (id[ii][jj]) {
                    merge(i, id[ii][jj]);
                    break;
                }
            }
            for (int ii = x - 1, jj = y + 1; ii && jj && ii <= n && jj <= n; --ii, ++jj) {
                if (id[ii][jj]) {
                    merge(i, id[ii][jj]);
                    break;
                }
            }
            for (int ii = x + 1, jj = y - 1; ii && jj && ii <= n && jj <= n; ++ii, --jj) {
                if (id[ii][jj]) {
                    merge(i, id[ii][jj]);
                    break;
                }
            }
            for (int ii = x + 1, jj = y + 1; ii && jj && ii <= n && jj <= n; ++ii, ++jj) {
                if (id[ii][jj]) {
                    merge(i, id[ii][jj]);
                    break;
                }
            }
        }
        if (typ == "N") {
            for (int j = 0; j < 8; ++j) {
                int xx = x + dx1[j], yy = y + dy1[j];
                if (xx > 0 && yy > 0 && xx <= n && yy <= n && id[xx][yy]) merge(i, id[xx][yy]);
            }
        }
        if (typ == "K") {
            for (int j = 0; j < 8; ++j) {
                int xx = x + dx2[j], yy = y + dy2[j];
                if (xx > 0 && yy > 0 && xx <= n && yy <= n && id[xx][yy]) merge(i, id[xx][yy]);
            }
        }
    }

    for (int i = 2; i <= m; ++i)
        if (find(i) != find(1)) return puts("NO"), 0;
    puts("YES");
    dfs(1, 0);
    return 0;
}