#include<bits/stdc++.h>
using namespace std;
#ifdef DEB
#define D if(1)
#else
#define D if(0)
#endif

#define fo(a,b) for(int a=0;a<(b);++a)
using ll = long long;

const int NMAX = 200;
const int OUTSTLEN = 20;

char in[NMAX][NMAX];

char out[NMAX*NMAX][OUTSTLEN];
int outLen;
int n;

vector<pair<int,int>> moves;

void go(int i, int j)
{
	in[i][j]=0;
	for(auto m:moves)
	{
		int I=i + m.first;
		int J=j + m.second;
		if(0<=I && I < n) if(0<=J && J<n)
		if(in[I][J])
		{
			sprintf(out[outLen++], "%d %d %d %d", I+1, J+1, i+1, j+1);
			go(I,J);
		}
	}
}

#define A(i,j) moves.push_back(make_pair(i,j))

void add_r()
{
			fo(i,n) A(0,n);
			fo(i,n) A(0,-n);
			fo(i,n) A(n,0);
			fo(i,n) A(-n,0);
}
void add_b()
{
			fo(i,n) A(n,n);
			fo(i,n) A(n,-n);
			fo(i,n) A(-n,n);
			fo(i,n) A(-n,-n);
}

int main(int argc, char ** argv)
{
	char t;

	scanf("%d %c",&n,&t);
	fo(i,n) scanf(" %s", in[i]);

	switch(t)
	{
		case 'R':
			add_r();
			break;
		case 'Q':
			add_r();
			add_b();
			break;
		case 'B':
			add_b();
			break;
		case 'N':
			for(int i=-1;i<2;i+=2) 
			for(int j=-1;j<2;j+=2) 
				A(i,2*j), A(2*i, j);
			break;
		case 'K':
			fo(i,3) fo(j,3) A(i-1,j-1);
			break;
	}

	int c = 0;

	fo(i,n) fo(j,n) if(in[i][j]=='.') in[i][j]=0; else c++;


	fo(start_i,n) fo(start_j,n) if(in[start_i][start_j])
	{
		go(start_i, start_j);
		D printf("%d %d\n", outLen, c);
		if(outLen != c-1)
			printf("NO\n");
		else
		{
			printf("YES\n");
			for(int x=n;x-->0;) printf("%s\n", out[x]); 
		}
		return 0;
	}
}