#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 110
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int n;char ch,mp[N][N];
struct node {
	int x,y,id;
}q[N*N];int tot,fa[N*N],pos[N][N];
vector<int>G[N*N];
int find(int x) {
	if(fa[x]==x) return x;
	return fa[x]=find(fa[x]);
}
void merge(int x,int y) {
	if(find(x)!=find(y)) fa[find(x)]=find(y),G[x].push_back(y),G[y].push_back(x);
}
void Rook() {
	rep(i,1,n) rep(j,1,n) if(mp[i][j]==ch) {
		drep(k,j-1,1) if(mp[i][k]==ch) merge(pos[i][j],pos[i][k]);
		drep(k,i-1,1) if(mp[k][j]==ch) merge(pos[i][j],pos[k][j]);
	}
}
void Bishop() {
	rep(i,1,n) rep(j,1,n) if(mp[i][j]==ch) {
		rep(k,1,min(i-1,j-1)) if(mp[i-k][j-k]==ch) merge(pos[i][j],pos[i-k][j-k]);
		rep(k,1,min(i-1,n-j)) if(mp[i-k][j+k]==ch) merge(pos[i][j],pos[i-k][j+k]);
	}
}
int dx[]={-1,-2,1,2};
int dy[]={-2,-1,-2,-1};
void Knight() {
	rep(i,1,n) rep(j,1,n) if(mp[i][j]==ch) {
		rep(k,0,3) {
			int x=i+dx[k],y=j+dy[k];
			if(x>=1&&x<=n&&y>=1&&y<=n&&mp[x][y]==ch) merge(pos[i][j],pos[x][y]);
		}
	}
}
int Dx[]={-1,-1,-1,0};
int Dy[]={-1,0,1,-1};
void King() {
	rep(i,1,n) rep(j,1,n) if(mp[i][j]==ch) {
		rep(k,0,3) {
			int x=i+Dx[k],y=j+Dy[k];
			if(x>=1&&x<=n&&y>=1&&y<=n&&mp[x][y]==ch) merge(pos[i][j],pos[x][y]);
		}
	}
}
void dfs(int x,int fat) {
	for(auto v:G[x]) if(v!=fat) {
		dfs(v,x);
		printf("%d %d %d %d\n",q[v].x,q[v].y,q[x].x,q[x].y);
	}
}
int main() {
	n=rd();ch=getchar();
	rep(i,1,n) scanf("%s",mp[i]+1);
	rep(i,1,n) {
		rep(j,1,n) if(mp[i][j]==ch) {
			q[++tot]=(node) {i,j,tot},pos[i][j]=tot;
			fa[tot]=tot;
		}
	}
	if(ch=='R') Rook();
	if(ch=='Q') Rook(),Bishop();
	if(ch=='B') Bishop();
	if(ch=='N') Knight();
	if(ch=='K') King();
	rep(i,1,tot) if(find(i)!=find(1)) {
		puts("NO");
		return 0;
	}
	puts("YES");
	dfs(1,0);
	return 0;
}