#include <bits/stdc++.h>

using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define rep(a, b, c) for(int (a)=(b);(a)<=(c);(a)++)
#define per(a, b, c) for(int (a)=(b);(a)>=(c);(a)--)
#define mset(var, val) memset(var,val,sizeof(var))
#define ll long long
#define int ll
#define fi first
#define se second
#define no printf("NO\n")
#define yes printf("YES\n")
#define pb push_back
#define endl "\n"
#define pii pair<int,int>
#define pll pair<ll,ll>
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)

void err() { cout << '\n'; }

template<class T, class... Ts>
void err(T arg, Ts... args) {
    cout << arg << ' ';
    err(args...);
}

const int N = 10005;
const int M = 100005;

const int dx1[4] = {1, -1, 0, 0};
const int dy1[4] = {0, 0, 1, -1};
const int dx2[4] = {1, -1, 1, -1};
const int dy2[4] = {1, -1, -1, 1};
const int dx[8] = {1, 1, -2, 2, -1, -1, 2, -2};
const int dy[8] = {2, -2, 1, 1, -2, 2, -1, -1};


int n, fa[N];
char c;
string s[105];
int tot=0, lnk[N], nxt[M], son[M];
bool vis[N];

int find(int x) {
	return fa[x] == x ? x: fa[x] = find(fa[x]);
}

void add(int x, int y) {
	son[++tot] = y, nxt[tot] = lnk[x], lnk[x] = tot;
	// printf("%d %d->%d %d\n", (x-1)/n+1,/ (x-1)%n+1, (y-1)/n+1, (y-1)%n+1);
	fa[find(x)] = find(y);
}

void dfs(int u) {
	vis[u] = 1;
	for(int i = lnk[u]; i; i = nxt[i]) {
		int v = son[i];
		if(vis[v]) continue;
		dfs(v);
		printf("%d %d %d %d\n", (v-1)/n+1, (v-1)%n+1, (u-1)/n+1, (u-1)%n+1);
	}
}

void solve() {
    cin >> n >> c;
    for(int i = 0; i < n; i++) cin >> s[i];

    for(int i = 1; i <= n*n; i++) fa[i] = i, vis[i] = 0;

    if(c == 'R' || c == 'Q') {
        for(int i = 0; i < n; i++) {
        	for(int j = 0; j < n; j++) {
        		if(s[i][j] != '.') {
        			for(int k = 0; k < 4; k++) {
        				int x = i+dx1[k], y = j+dy1[k];
        				while(x >= 0 && x < n && y >= 0 && y < n && s[x][y] == '.')
        					x+=dx1[k], y+=dy1[k];
        				if(x >= 0 && x < n && y >= 0 && y < n && s[x][y] != '.')
        					add(i*n+j+1, x*n+y+1);
        			}
        		}
        	}
        }
    }
    if(c == 'B' || c == 'Q') {
    	for(int i = 0; i < n; i++) {
        	for(int j = 0; j < n; j++) {
        		if(s[i][j] != '.') {
        			for(int k = 0; k < 4; k++) {
        				int x = i+dx2[k], y = j+dy2[k];
        				while(x >= 0 && x < n && y >= 0 && y < n && s[x][y] == '.')
        					x+=dx2[k], y+=dy2[k];
        				if(x >= 0 && x < n && y >= 0 && y < n && s[x][y] != '.')
        					add(i*n+j+1, x*n+y+1);
        			}
        		}
        	}
        }
    }

    if(c == 'N') {
        for(int i = 0; i < n; i++) {
        	for(int j = 0; j < n; j++) {
        		if(s[i][j] != '.') {
        			for(int k = 0; k < 8; k++) {
        				int x = i+dx[k], y = j+dy[k];
        				if(x >= 0 && x < n && y >= 0 && y < n && s[x][y] != '.')
        					add(i*n+j+1, x*n+y+1);
        			}
        		}
        	}
        }
    }
    if(c == 'K') {
    	for(int i = 0; i < n; i++) {
        	for(int j = 0; j < n; j++) {
        		if(s[i][j] != '.') {
        			for(int k = 0; k < 4; k++) {
        				int x = i+dx1[k], y = j+dy1[k];
        				if(x >= 0 && x < n && y >= 0 && y < n && s[x][y] != '.')
        					add(i*n+j+1, x*n+y+1);
        			}
        			for(int k = 0; k < 4; k++) {
        				int x = i+dx2[k], y = j+dy2[k];
        				if(x >= 0 && x < n && y >= 0 && y < n && s[x][y] != '.')
        					add(i*n+j+1, x*n+y+1);
        			}
        		}
        	}
        }
    }
    int cnt=0, p=0;
    for(int i = 0; i < n; i++)
    	for(int j = 0; j < n; j++) {
    		int x = i*n+j+1;
    		if(s[i][j] != '.' && fa[x] == x) cnt++, p = x;
    	}
    if(cnt > 1) {
    	no;
    	return;
    }
    // printf("%d\n", p);
    yes;
    dfs(p);
}

signed main() {
    // IOS;
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}
/*
5 Q
Q....
.Q...
..Q..
...Q.
....Q
*/