#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

using ll = long long;
using ull = unsigned long long ;
using ld = long double ;
using str = string;
using ordered_set=tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>;

const double PI=acos(-1);
const ll INF = 1LL<<62;
const ll MINF = -(1LL<<62);

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)

vector<int> G[20001];

int n;
char exc;
string t[101];

vector<pair<pair<int,int>, pair<int,int>>> ans;
int st[20001];
pair<int,int> dfs(int x) {
	st[x]=1;
	int xx=x/n, yy=x%n;
	for(int i:G[x]) {
		if(!st[i]) {
			auto from=dfs(i);
			ans.pb({from, {xx,yy}});
		}
	}
	
	return {xx,yy};
}

struct dsu {
	vector<int> par;
	vector<int> sz;
	dsu(int n) : par(n,-1) {sz.assign(n,1);}
	
	int get(int x) {
		if(par[x]==-1) return x;
		return par[x]=get(par[x]);
	}
	
	bool merge(int x, int y) {
		int px=get(x), py=get(y);
		if(px==py) return false;
		
		if(sz[px]>sz[py]) {
			swap(px,py);
			swap(x,y); //:) lyft
		}
		
		sz[py]+=sz[px];
		par[px]=py;
		
		//~ LOG(x);
		//~ LOG(y);
		
		G[x].pb(y);
		G[y].pb(x);
		
		return true;
	}
};

dsu ds(1);

map<char, vector<pair<int,int>>> d={
	{'K', {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}},
	{'N', {{-1,-2},{-1,2},{1,2},{1,-2},{-2,-1},{2,-1},{2,1},{-2,1}}},
};

bool valid(int x, int y) {
	return x>=0 && y>=0 && x<n && y<n;
}

int conv(int x, int y) {
	return x*n+y;
}

void check_rook(int x, int y) {
	assert(t[x][y]!='.');
	for(int i=0;i<n;++i) {
		if(t[x][i]==t[x][y]) ds.merge(conv(x,i), conv(x,y));
		//~ if(t[i][x]==t[x][y]) ds.merge(conv(i,x), conv(x,y));
		if(t[i][y]==t[x][y]) ds.merge(conv(i,y), conv(x,y));
	}
}

void check_bishop(int x, int y) {
	assert(t[x][y]!='.');
	for(int i=-n;i<n;++i) {
		int nx=x+i, ny=y+i;
		if(valid(nx, ny) && t[nx][ny]==t[x][y]) ds.merge(conv(nx, ny), conv(x, y));
	}
	for(int i=-n;i<n;++i) {
		int nx=x-i, ny=y+i;
		if(valid(nx, ny) && t[nx][ny]==t[x][y]) ds.merge(conv(nx, ny), conv(x, y));
	}
}
	
	
int main() {
	IO;
	
	cin>>n>>exc;
	for(int i=0;i<n;++i) cin>>t[i];
	
	ds=dsu(n*n);
	
	for(int i=0;i<n;++i) {
		for(int j=0;j<n;++j) {
			if(t[i][j]!='.') {
				if(exc=='R') {
					check_rook(i,j);
				}else if(exc=='Q') {
					check_rook(i,j);
					check_bishop(i,j);
				}else if(exc=='B') {
					check_bishop(i,j);
				}else if(exc=='N' || exc=='K') {
					for(pair<int,int> dd:d[exc]) {
						int ni=i+dd.xx, nj=j+dd.yy;
						if(valid(ni, nj) && t[ni][nj]==t[i][j]) {
							ds.merge(conv(i,j), conv(ni, nj));
						}
					}
				}else assert(0);
			}
		}
	}
	
	set<int> s;
	for(int i=0;i<n;++i) {
		for(int j=0;j<n;++j) {
			if(exc==t[i][j]) s.insert(ds.get(conv(i,j)));
		}
	}
	
	if(sz(s)>1 || sz(s)==0) {
		cout<<"NO\n";
		return 0;
	}
	
	dfs(*s.begin());
	
	cout<<"YES\n";
	for(auto i:ans) {
		cout<<i.xx.xx+1<<" "<<i.xx.yy+1<<" "<<i.yy.xx+1<<" "<<i.yy.yy+1<<"\n";
	}
	
	
	
	return 0;
}