// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

#define vt vector

int main() {
	int n; cin >> n;
	char type; cin >> type;
	vt<vt<vt<array<int, 2>>>> g(n, vt<vt<array<int, 2>>>(n));
	vt<vt<array<int, 2>>> hor(n), vert(n), diag1(2*n+1), diag2(2*n+1);
	auto add = [&](vt<array<int, 2>> &arr, array<int, 2> p) {
		if(!arr.empty()) {
			auto [a,b] = arr.back();
			g[a][b].push_back(p);
			g[p[0]][p[1]].push_back({a, b});
		}
		arr.push_back(p);
	};
	vt<string> t(n);
	for(auto &s: t) {
		cin >> s;
	}
	int cnt = 0;
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) if(t[i][j] == type) {
			if(type == 'R') {
				add(hor[i], {i, j});
				add(vert[j], {i, j});
			} else if(type == 'Q') {
				add(hor[i], {i, j});
				add(vert[j], {i, j});
				add(diag1[i+j], {i, j});
				add(diag2[j-i+n], {i, j});
			} else if(type == 'B') {
				add(diag1[i+j], {i, j});
				add(diag2[j-i+n], {i, j});
			} else if(type == 'N') {
				// int dx[] = {-1,+1,-2,-2};
				// int dy[] = {-2,-2,-1,+1};
				// for(int k = 0; k < 4; ++k) {
				for (auto dx: {1,2}) for(auto dy : {1,2}) if(dx + dy == 3) {
					for(auto a: {-1,+1}) for(auto b: {-1, +1}) {
						int nx = i + dx * a, ny = j + dy * b;
						if(nx >= 0 && nx < n && ny >= 0 && ny < n && t[nx][ny] == type) {
							// g[nx][ny].push_back({i, j});
							g[i][j].push_back({nx, ny});
							// cout << i << " " << j << " " << nx << " " << ny << " hi\n";
						}
					}
				}
			} else if(type == 'K') {
				int dx[] = {0,0,+1,-1,+1,+1,-1,-1};
				int dy[] = {+1,-1,0,0,-1,+1,-1,+1};
				for(int k = 0; k < 8; ++k) {
					int nx = i + dx[k], ny = j + dy[k];
					if(nx >= 0 && nx < n && ny >= 0 && ny < n && t[nx][ny] == type) {
						g[i][j].push_back({nx, ny});
					}
				}
			}
			++cnt;
		}
	}
	vt<vt<int>> used(n, vt<int>(n, false));
	vt<array<int, 4>> res;
	auto Dfs = [&](auto self, int x, int y, int px, int py) -> void {
		if(used[x][y]) {
			return ;
		}
		// cout << x << " " << y << "\n";
		used[x][y] = 1;
		--cnt;
		for(auto [nx, ny] : g[x][y]) {
			self(self, nx, ny, x, y);
		}
		if(x != px || y != py) {
			res.push_back({x, y, px, py});
		}
	};
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) if(t[i][j] == type) {
			Dfs(Dfs, i, j, i, j);
			if(cnt) {
				cout << "NO\n";
				return 0;
			}
			break;
		}
	}
	// assert(res.size() + 1 == n);
	cout << "YES\n";
	for(auto v: res) {
		for(auto x: v) {
			cout << x + 1 << " ";
		}
		cout << "\n";
	}
}