#include <iostream>
#include <cstdio>
#define mn 15005

using namespace std;


int n, cnt, h[mn], d[mn], vis[mn];
char c, a[105][105];


struct E {
	int to, nxt;
}e[100000005];

int get(int x, int y) {
	return (x - 1) * n + y;
}
int find(int x) {
	return x == d[x] ? x : d[x] = find(d[x]);
}
void add(int u, int v) {
	e[++cnt] = (E){v, h[u]}, h[u] = cnt;
	d[find(u)] = find(v);
}

void link(int x, int y) {
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= n; ++j) {
			if(i == x && j == y) continue;
			if(a[i][j] == '.') continue;
			int f = 0;
			if(c == 'R' && (i == x || j == y)) f = 1;
			if(c == 'Q' && (i == x || j == y || i - j == x - y || i + j == x + y)) f = 1;
			if(c == 'B' && (i - j == x - y || i + j == x + y)) f = 1;
			if(c == 'N' && ((abs(i - x) == 2 && abs(j - y) == 1) || (abs(i - x) == 1 && abs(j - y) == 2))) f = 1;
			if(c == 'K' && (abs(i - x) <= 1 && abs(j - y) <= 1)) f = 1;
			if(f) add(get(x, y), get(i, j));
		}
	}
}
void print(int x, int y) {
	printf("%d %d %d %d\n", (x - 1) / n + 1, (x - 1) % n + 1, (y - 1) / n + 1, (y - 1) % n + 1);
}
void dfs(int u) {
	vis[u] = 1;
	for(int i = h[u]; i; i = e[i].nxt) {
		int v = e[i].to;
		if(vis[v]) continue;
		dfs(v);
		print(v, u);
	}
}

int main() {
	scanf("%d %c\n", &n, &c);
	for(int i = 1; i <= n; ++i) {
		scanf("%s", a[i] + 1);
	}
	for(int i = 1; i <= n * n; ++i) {
		d[i] = i;
	}
	// RQBNK
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= n; ++j) {
			if(a[i][j] != '.') {
				link(i, j);
			}
		}
	}
	int s = 0, r;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= n; ++j) {
			if(a[i][j] == '.') continue;
			int x = get(i, j);
			if(d[x] == x) ++s, r = x;
		}
	}
	if(s != 1) {
		return puts("NO"), 0;
	}
	puts("YES");
	dfs(r);
	return 0;
}