#include<bits/stdc++.h>
using namespace std;
using lld = long long;
using int128 = __int128_t;

struct T {
	int a,b;
};

struct Graph {
	vector<int> path;
	bool vis = false;
};

vector<T> res;

void dfs(vector<Graph>& g, int v) {
	g[v].vis = true;
	for(int u : g[v].path)
		if(!g[u].vis) {
			res.push_back({u,v});
			dfs(g,u);
		}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	char k;
	cin >> n >> k;

	vector<string> t(n);
	for(auto& i : t)
		cin >> i;

	vector<int> pos;

	vector<Graph> g(n*n);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(t[i][j] != '.') {
				pos.push_back(i*n+j);
				switch(t[i][j]) {
					case 'B':
						for(int a=i+1,b=j+1;a<n && b<n;a++,b++)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i+1,b=j-1;a<n && b>=0;a++,b--)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i-1,b=j+1;a>=0 && b<n;a--,b++)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i-1,b=j-1;a>=0 && b>=0;a--,b--)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						break;
					case 'Q':
						for(int a=i+1,b=j+1;a<n && b<n;a++,b++)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i+1,b=j-1;a<n && b>=0;a++,b--)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i-1,b=j+1;a>=0 && b<n;a--,b++)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int a=i-1,b=j-1;a>=0 && b>=0;a--,b--)
							if(t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						for(int x=0;x<n;x++)
							if(x != i && t[x][j] != '.') g[x*n+j].path.push_back(i*n+j);
						for(int x=0;x<n;x++)
							if(x != j && t[i][x] != '.') g[i*n+x].path.push_back(i*n+j);
						break;
					case 'R':
						for(int x=0;x<n;x++)
							if(x != i && t[x][j] != '.') g[x*n+j].path.push_back(i*n+j);
						for(int x=0;x<n;x++)
							if(x != j && t[i][x] != '.') g[i*n+x].path.push_back(i*n+j);
						break;
					case 'K':
						for(int a=max(0,i-1);a<=min(i+1,n-1);a++)
							for(int b=max(0,j-1);b<=min(j+1,n-1);b++)
								if((a != i || b != j) && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						break;
					case 'N':
						int a,b;
						a = i-2, b = j-1; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i-2, b = j+1; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i+2, b = j-1; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i+2, b = j+1; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i-1, b = j-2; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i-1, b = j+2; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i+1, b = j-2; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						a = i+1, b = j+2; if(0 <= a && a < n && 0 <= b && b < n && t[a][b] != '.') g[a*n+b].path.push_back(i*n+j);
						break;
				}
			}

	if(pos.empty()) {
		cout << "YES\n";
		return 0;
	}

	dfs(g,pos[0]);

	if(res.size() != pos.size()-1) {
		cout << "NO\n";
		return 0;
	}

	cout << "YES\n";
	reverse(res.begin(), res.end());
	for(auto& i : res)
		cout << i.a/n+1 << " " << i.a%n+1 << " " << i.b/n+1 << " " << i.b%n+1 << "\n";

	return 0;
}