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

#define REP(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;++i)

static const int M=103;
#define ID(a,b) ((a)*M+(b))

int n;
char c,S[M][M];
vector<int>E[M*M];
int Fa[M*M],Sz[M*M];
int GetFa(int x){
	return Fa[x]==x?x:Fa[x]=GetFa(Fa[x]);
}
void Union(int x,int a,int b){
	if(a<0 || b<0 || a>=n || b>=n || S[a][b]=='.')return;
	int y=ID(a,b);
	//cerr<<x<<','<<y<<endl;
	int xx=GetFa(x),yy=GetFa(y);
	if(xx!=yy){
		Fa[xx]=yy;
		Sz[yy]+=Sz[xx];
		E[x].push_back(y);
		E[y].push_back(x);
	}
}
void DFS(int x,int f){
	for(auto y:E[x])if(y!=f){
		DFS(y,x);
		printf("%d %d %d %d\n",y/M+1,y%M+1,x/M+1,x%M+1);
	}
}
int main(){
	scanf("%d %c",&n,&c);
	REP(i,0,n)scanf("%s",S[i]);
	
	REP(i,0,n)REP(j,0,n)Fa[ID(i,j)]=ID(i,j),Sz[ID(i,j)]=1;
	int t=0;
	REP(i,0,n)REP(j,0,n)
		if(S[i][j]!='.'){
			int x=ID(i,j);
			++t;
			if(c=='R'){
				REP(k,i+1,n)
					Union(x,k,j);
				REP(k,j+1,n)
					Union(x,i,k);
			}
			else if(c=='B'){
				for(int t=1;i+t<n && j+t<n;++t)
					Union(x,i+t,j+t);
				for(int t=1;i+t<n && j-t>=0;++t)
					Union(x,i+t,j-t);
			}
			else if(c=='Q'){
				REP(k,i+1,n)
					Union(x,k,j);
				REP(k,j+1,n)
					Union(x,i,k);
				for(int t=1;i+t<n && j+t<n;++t)
					Union(x,i+t,j+t);
				for(int t=1;i+t<n && j-t>=0;++t)
					Union(x,i+t,j-t);
			}
			else if(c=='K'){
				Union(x,i,j+1);
				Union(x,i+1,j-1);
				Union(x,i+1,j);
				Union(x,i+1,j+1);
			}
			else if(c=='N'){
				Union(x,i+1,j-2);
				Union(x,i+1,j+2);
				Union(x,i+2,j-1);
				Union(x,i+2,j+1);
			}
		}
	REP(i,0,n)REP(j,0,n)
		if(S[i][j]!='.'){
			int x=ID(i,j);
			if(Sz[GetFa(x)]!=t){
				puts("NO");
				return 0;
			}
			puts("YES");
			DFS(x,0);
			return 0;
		}
	return 0;
}