#pragma ide diagnostic ignored "misc-no-recursion"

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef double db;

#define TESTCASE 0

static constexpr int MOD = 998'244'353;
static constexpr int INF = 1e9;


static void solve([[maybe_unused]] int tc) {
    int N;
    char E;
    cin >> N >> E;

    vector<string> grid(N);
    for (int i = 0; i < N; i++) {
        cin >> grid[i];
    }

    vector<int> pieces;
    vector<vector<int>> graph(N * N);
    for (int i0 = 0; i0 < N; i0++) {
        for (int j0 = 0; j0 < N; j0++) {
            if (grid[i0][j0] == '.') continue;
            pieces.push_back(i0 * N + j0);

            for (int i1 = 0; i1 < N; i1++) {
                for (int j1 = 0; j1 < N; j1++) {
                    if (grid[i1][j1] == '.') continue;
                    if (i0 == i1 && j0 == j1)  continue;

                    int di = abs(i0 - i1), dj = abs(j0 - j1);

                    if ((di == 0 || dj == 0) && (E == 'R' || E == 'Q')) {
                        graph[i1 * N + j1].push_back(i0 * N + j0);
                    }
                    if (((i0 - j0 == i1 - j1) || (i0 + j0 == i1 + j1)) && (E == 'B' || E == 'Q')) {
                        graph[i1 * N + j1].push_back(i0 * N + j0);
                    }
                    if (di <= 1 && dj <= 1 && E == 'K') {
                        graph[i1 * N + j1].push_back(i0 * N + j0);
                    }
                    if (((di == 2 && dj == 1) || (di == 1 && dj == 2)) && E == 'N') {
                        graph[i1 * N + j1].push_back(i0 * N + j0);
                    }
                }
            }
        }
    }

    shuffle(pieces.begin(), pieces.end(), mt19937(696969)); // just in case...

    vector<char> vis(N * N);
    vector<pair<int, int>> moves;
    for (int p : pieces) {
        fill(vis.begin(), vis.end(), 0);
        moves.clear();

        queue<int> Q;
        Q.push(p);
        vis[p] = 1;

        while (!Q.empty()) {
            int u = Q.front();
            Q.pop();

            for (int v : graph[u]) {
                if (vis[v]) continue;
                vis[v] = 1;
                Q.push(v);
                moves.emplace_back(u, v);
            }
        }

        if (count(vis.begin(), vis.end(), 1) == pieces.size()) {
            cout << "YES\n";

            reverse(moves.begin(), moves.end());
            for (auto [v, u] : moves) {
                cout << (u / N + 1) << ' ' << (u % N + 1) << ' ' << (v / N + 1) << ' ' << (v % N + 1) << '\n';
            }

            return;
        }

        break;
    }

    cout << "NO\n";
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}