#include<bits/stdc++.h>
#define maxn 105
int n;
std::string c;
std::string str[maxn];
int id[maxn][maxn];
std::pair<int,int> pos[maxn * maxn];
int cnt;
bool vis[maxn * maxn];
std::vector<int> G[maxn * maxn];
std::pair<int,int> N[8] = {{-2,1},{-2,-1},{-1,-2},{-1,2},{1,2},{1,-2},{2,-1},{2,1}};
std::pair<int,int> K[8] = {{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};
void dfs(int u) {
	for(auto i:G[u]) {
		dfs(i);
		printf("%d %d %d %d\n",pos[i].first + 1,pos[i].second + 1,pos[u].first + 1,pos[u].second + 1);
	}

}
int main() {
	std::cin >> n >> c;
	for(int i = 0; i < n; i++) {
		std::cin >> str[i];
		for(int j = 0; j < n; j++) {
			if (str[i][j] != '.') {
				id[i][j] = ++cnt;
				pos[cnt] = {i,j};
			}
		}
	}
	std::queue<int> que;
	vis[0] = 1;
	std::pair<int,int> *dir = (c[0] == 'N' ? N : K); 
	que.push(1);
	vis[1] = 1;
	int C = 0;
	while(!que.empty()) {
		C++;
		int nowid = que.front();
		que.pop();
		std::pair<int,int> now = pos[nowid];
		// printf("%d %d\n",now.first,now.second);
		if (c[0] == 'R' || c[0] == 'Q') {
			for(int i = 0; i < n; i++) {
				if (!vis[id[now.first][i]]) {
					que.push(id[now.first][i]);
					vis[id[now.first][i]] = 1;
					G[nowid].push_back(id[now.first][i]);
				}
				if (!vis[id[i][now.second]]) {
					que.push(id[i][now.second]);
					vis[id[i][now.second]] = 1;
					G[nowid].push_back(id[i][now.second]);
				}
			}
		}
		if (c[0] == 'Q' || c[0] == 'B') {
			for(int i = -100; i <= 100; i++) {
				int x = now.first + i, y = now.second + i;
				if (x >= 0 && x < n && y >= 0 && y < n) {
					if (!vis[id[x][y]]) {
						que.push(id[x][y]);
						vis[id[x][y]] = 1;
						G[nowid].push_back(id[x][y]);
					}
				}
				x = now.first - i, y = now.second + i;
				if (x >= 0 && x < n && y >= 0 && y < n) {
					if (!vis[id[x][y]]) {
						que.push(id[x][y]);
						vis[id[x][y]] = 1;
						G[nowid].push_back(id[x][y]);
					}
				}
			}
		}
		if (c[0] == 'K' || c[0] == 'N') {
			for(int i = 0; i < 8; i++) {
				int x = now.first + dir[i].first, y = now.second + dir[i].second;
				if (x >= 0 && x < n && y >= 0 && y < n) {
					if (!vis[id[x][y]]) {
						que.push(id[x][y]);
						vis[id[x][y]] = 1;
						G[nowid].push_back(id[x][y]);
					}
				}
			}
		}
	}
	if (C < cnt) {
		printf("NO\n");
		return 0;
	}
	printf("YES\n");
	dfs(1);
}