#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	char ch;
	cin>>n>>ch;
	vector<string> a(n+5);
	string tt;
	getline(cin,tt);
	for(int i=1;i<=n;i++)
	{
		getline(cin,tt);
//		tt="BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB";
		a[i]=' '+tt;
	}
	if(ch=='B')
	{
		int tmp=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(a[i][j]=='B')
				{
					tmp|=1<<((i+j)%2);
				}
			}
		}
		if(tmp==3)
		{
			cout<<"NO"<<endl;
			return 0;
		}
	}
	auto inb=[&](int x,int y){return 1<=x and x<=n and 1<=y and y<=n;};
	vector<vector<int>> G(n*n+5);
	auto addedge=[&](int u,int v)
	{
		G[v].push_back(u);
	};
	auto hs=[&](int x,int y){return (x-1)*n+y;};
	vector<int> dx={1,0,-1,0,1,1,-1,-1};
	vector<int> dy={0,1,0,-1,1,-1,1,-1};
	vector<int> ndx={1,2,-2,1,-1,2,-1,-2};
	vector<int> ndy={2,1,1,-2,2,-1,-2,-1};
	int cnt=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(a[i][j]=='K')
			{
				for(int d=0;d<8;d++)
				{
					int nx=i+dx[d],ny=j+dy[d];
					if(inb(nx,ny) and a[nx][ny]!='.')
						addedge(hs(i,j),hs(nx,ny));
				}
				cnt++;
			}
			else if(a[i][j]=='Q')
			{
				for(int d=0;d<8;d++)
				{
					for(int t=1;t<=n;t++)
					{
						int nx=i+dx[d]*t,ny=j+dy[d]*t;
						if(inb(nx,ny) and a[nx][ny]!='.')
						{
							addedge(hs(i,j),hs(nx,ny));
							break;
						}
					}
				}
				cnt++;
			}
			else if(a[i][j]=='R')
			{
				for(int d=0;d<4;d++)
				{
					for(int t=1;t<=n;t++)
					{
						int nx=i+dx[d]*t,ny=j+dy[d]*t;
						if(inb(nx,ny) and a[nx][ny]!='.')
						{
							addedge(hs(i,j),hs(nx,ny));
							break;
						}
					}
				}
				cnt++;
			}
			else if(a[i][j]=='B')
			{
				for(int d=4;d<8;d++)
				{
					for(int t=1;t<=n;t++)
					{
						int nx=i+dx[d]*t,ny=j+dy[d]*t;
						if(inb(nx,ny) and a[nx][ny]!='.')
						{
							addedge(hs(i,j),hs(nx,ny));
							break;
						}
					}
				}
				cnt++;
			}
			else if(a[i][j]=='N')
			{
				for(int d=0;d<8;d++)
				{
					int nx=i+ndx[d],ny=j+ndy[d];
					if(inb(nx,ny) and a[nx][ny]!='.')
						addedge(hs(i,j),hs(nx,ny));
				}
				cnt++;
			}
		}
	}
	vector<int> pa(n*n+5),vis(n*n+5),ord;
	function<void(int)> dfs=[&](int u)
	{
		vis[u]=1;
		for(auto v:G[u])
		{
			if(not vis[v])
			{
				pa[v]=u;
				dfs(v);
			}
		}
		ord.push_back(u);
	};
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			if(a[i][j]=='.')continue;
			ord.clear();
			fill(pa.begin(),pa.end(),0);
			fill(vis.begin(),vis.end(),0);
			dfs(hs(i,j));
			if((int)ord.size()==cnt)
			{
				cout<<"YES"<<endl;
				for(auto u:ord)
				{
					int v=pa[u];
					if(v)
					{
						cout<<(u-1)/n+1<<' '<<(u-1)%n+1<<' ';
						cout<<(v-1)/n+1<<' '<<(v-1)%n+1<<"\n";
					}
				}
				return 0;
			}
		}
	cout<<"NO"<<endl;
	return 0;
}