#include<bits/stdc++.h>
#define fo(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
#define ff first
#define ss second
#define vt vector
#define ins insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;

typedef unsigned long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef vt<int> vti;
const double Pi = acos(- 1.0);
template<typename T>ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {for(T x : vec) cout << x << ' '; cout << endl;return os;}
const int inf = INT_MAX;




void Duck(){
	int n; cin >> n;
	vt<string> s(n);
	char type; cin >> type;
	for(int i = 0; i < n; i++){
		cin >> s[i];
	}
	//cout << s;
	vt<array<int, 2>> pos;
	vt<vti> rpos(n, vti(n, -1));
	for(int i = 0; i < n; i++){
		for(int j = 0;  j < n; j++){
			if(s[i][j] != '.'){
				pos.pb({i, j});
				rpos[i][j] = pos.size()-1;
			}
		}
	}
	int m = pos.size();
	auto moveQ = [&](int x, int y){
		vt<array<int, 2>> res;
		for(int i = 0; i < m; i++){
			auto[nx, ny] = pos[i];
			if(nx == x && ny == y) continue;
			if(abs(nx - x) == abs(ny - y) || nx == x || ny == y){
				res.pb({nx, ny});
			}
		}
		return res;
	};
	auto moveK = [&](int x, int y){
		vt<array<int, 2>> res;
		for(int i = 0; i < m; i++){
			auto[nx, ny] = pos[i];
			if(nx == x && ny == y) continue;
			if((abs(ny - y) <= 1 && abs(nx - x) <= 1)){
				res.pb({nx, ny});
			}
		}
		return res;
	};
	auto moveR = [&](int x, int y){
		vt<array<int, 2>> res;
		for(int i = 0; i < m; i++){
			auto[nx, ny] = pos[i];
			if(nx == x && ny == y) continue;
			if(nx == x || ny == y){
				res.pb({nx, ny});
			}
		}
		return res;
	};
	auto moveB = [&](int x, int y){
		vt<array<int, 2>> res;
		for(int i = 0; i < m; i++){
			auto[nx, ny] = pos[i];
			if(nx == x && ny == y) continue;
			if(abs(nx - x) == abs(ny - y)){
				res.pb({nx, ny});
			}
		}
		return res;
	};
	auto moveN = [&](int x, int y){
		vt<array<int, 2>> res;
		for(int i = 0; i < m; i++){
			auto[nx, ny] = pos[i];
			if(nx == x && ny == y) continue;
			if((abs(ny - y) == 2 && abs(nx - x) == 1) || (abs(nx - x) == 2 && abs(ny - y) == 1)){
				res.pb({nx, ny});
			}
		}
		return res;
	};
	
	
	//vt<vt<array<int,2>>> g(m); 
	vt<vti> g(m);
	vti deg(m);
	for(int i = 0; i < m; i++){
		auto [x, y] = pos[i];
		if(type == 'K'){
			auto near = moveK(x, y);
			for(auto [nx, ny] : near){
				g[i].pb(rpos[nx][ny]);
				deg[i]++;
			}
		}
		if(type == 'Q'){
			auto near = moveQ(x, y);
			for(auto [nx, ny] : near){
				g[i].pb(rpos[nx][ny]);
				deg[i]++;
			}
		}
		if(type == 'R'){
			auto near = moveR(x, y);
			for(auto [nx, ny] : near){
				g[i].pb(rpos[nx][ny]);
				deg[i]++;
			}
		}
		if(type == 'B'){
			auto near = moveB(x, y);
			for(auto [nx, ny] : near){
				g[i].pb(rpos[nx][ny]);
				deg[i]++;
			}
		}
		if(type == 'N'){
			auto near = moveN(x, y);
			for(auto [nx, ny] : near){
				g[i].pb(rpos[nx][ny]);
				deg[i]++;
			}
		}
	}
//	cout << g;
	vt<array<int, 4>> ans;
	vti vis(m, 0);
	function<void(int)> dfs = [&](int i){
		vis[i] = 1;
		for(auto j : g[i]){
			if(!vis[j]){
				dfs(j);
				ans.pb({pos[j][0] + 1, pos[j][1] + 1, pos[i][0] + 1, pos[i][1] + 1});
			}
		}
	};
	dfs(0);
	for(int i = 0; i < m; i++){
		if(!vis[i]){
			cout << "NO\n";
			return;
		}
	}
	cout << "YES\n";
	for(auto [x, y, z, t] : ans){
		cout << x << ' ' << y << ' ' << z << ' ' << t << '\n';
	} 
}



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	/*Duck3*/
	int t = 1;
	#ifndef ONLINE_JUDGE
		freopen("input.txt", "r", stdin);
	#endif
	//cin >> t;
	while(t--) Duck();
	return 0;
}
/*
Test:

*/