import java.util.*;
import java.io.*;
import java.math.*;

public class Main {

    public static void main(String[] args) {
        //int t = f.nextInt();while(t-- > 0)
            solve();
        out.close();
    }


    static Node[][] nodes;
    static void solve() {
        int n = f.nextInt();
        char c = f.next().charAt(0);

        nodes = new Node[n][n];

        for(int i=0;i<n;i++) {
            String s = f.next();
            for(int j=0;j<n;j++) {
                nodes[i][j] = new Node(s.charAt(j));
            }
        }


        // create graph

        if(c == 'R') {
            for(int i=0;i<n;i++) {
                int lastInd = -1;
                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {

                        if(lastInd != -1) {
                            nodes[i][j].adj.add(new int[] {i,lastInd});
                            nodes[i][lastInd].adj.add(new int[] {i,j});
                        }

                        lastInd = j;
                    }
                }
            }

            for(int j=0;j<n;j++) {
                int lastInd = -1;
                for(int i=0;i<n;i++) {
                    if(nodes[i][j].c == c) {

                        if(lastInd != -1) {
                            nodes[i][j].adj.add(new int[] {lastInd,j});
                            nodes[lastInd][j].adj.add(new int[] {i,j});
                        }

                        lastInd = i;
                    }
                }
            }

        } else if(c == 'Q') {
            for(int i=0;i<n;i++) {
                int lastInd = -1;
                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {

                        if(lastInd != -1) {
                            nodes[i][j].adj.add(new int[] {i,lastInd});
                            nodes[i][lastInd].adj.add(new int[] {i,j});
                        }

                        lastInd = j;
                    }
                }
            }

            for(int j=0;j<n;j++) {
                int lastInd = -1;
                for(int i=0;i<n;i++) {
                    if(nodes[i][j].c == c) {

                        if(lastInd != -1) {
                            nodes[i][j].adj.add(new int[] {lastInd,j});
                            nodes[lastInd][j].adj.add(new int[] {i,j});
                        }

                        lastInd = i;
                    }
                }
            }

            // NEXT
            ArrayList<int[]>[] diag = new ArrayList[205];
            for(int i=0;i<205;i++) {
                diag[i] = new ArrayList<>();
            }
            for(int i=0;i<n;i++) {

                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {
                        diag[i - j + 102].add(new int[]{i, j});
                    }
                }
            }

            int[] lst = new int[2];
            for(int i=0;i<205;i++) {
                lst[0] = -1; lst[1] = -1;
                for(int[] j : diag[i]) {
                    if(lst[0] != -1) {
                        nodes[lst[0]][lst[1]].adj.add(new int[] {j[0],j[1]});
                        nodes[j[0]][j[1]].adj.add(new int[] {lst[0],lst[1]});
                    }
                    lst[0] = j[0];
                    lst[1] = j[1];
                }
            }

            diag = new ArrayList[205];
            for(int i=0;i<205;i++) {
                diag[i] = new ArrayList<>();
            }

            for(int i=0;i<n;i++) {

                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c && j-i != 0)
                        diag[j-i+102].add(new int[]{i,j});
                }
            }

            lst = new int[2];
            for(int i=0;i<205;i++) {
                lst[0] = -1; lst[1] = -1;
                for(int[] j : diag[i]) {
                    if(lst[0] != -1) {
                        nodes[lst[0]][lst[1]].adj.add(new int[] {j[0],j[1]});
                        nodes[j[0]][j[1]].adj.add(new int[] {lst[0],lst[1]});

                    }
                    lst[0] = j[0];
                    lst[1] = j[1];
                }
            }
        } else if(c == 'B') {
            // NEXT
            ArrayList<int[]>[] diag = new ArrayList[205];
            for(int i=0;i<205;i++) {
                diag[i] = new ArrayList<>();
            }
            for(int i=0;i<n;i++) {

                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {
                        diag[i - j + 102].add(new int[]{i, j});
                    }
                }
            }

            int[] lst = new int[2];
            for(int i=0;i<205;i++) {
                lst[0] = -1; lst[1] = -1;
                for(int[] j : diag[i]) {
                    if(lst[0] != -1) {
                        nodes[lst[0]][lst[1]].adj.add(new int[] {j[0],j[1]});
                        nodes[j[0]][j[1]].adj.add(new int[] {lst[0],lst[1]});
                    }
                    lst[0] = j[0];
                    lst[1] = j[1];
                }
            }

            diag = new ArrayList[205];
            for(int i=0;i<205;i++) {
                diag[i] = new ArrayList<>();
            }

            for(int i=0;i<n;i++) {

                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c)
                        diag[j+i].add(new int[]{i,j});
                }
            }

            lst = new int[2];
            for(int i=0;i<205;i++) {
                lst[0] = -1; lst[1] = -1;
                for(int[] j : diag[i]) {
                    if(lst[0] != -1) {
                        nodes[lst[0]][lst[1]].adj.add(new int[] {j[0],j[1]});
                        nodes[j[0]][j[1]].adj.add(new int[] {lst[0],lst[1]});

                    }
                    lst[0] = j[0];
                    lst[1] = j[1];
                }
            }
        } else if(c == 'N') {
            int[][] dir = {{1,2},{2,1},{2,-1},{1,-2}};
            for(int i=0;i<n;i++) {
                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {
                        for(int[] dirs : dir) {
                            int nowI = i + dirs[0];
                            int nowJ = j + dirs[1];

                            if(nowI >= 0 && nowI < n && nowJ >= 0 && nowJ < n && nodes[nowI][nowJ].c == c) {
                                nodes[nowI][nowJ].adj.add(new int[] {i,j});
                                nodes[i][j].adj.add(new int[] {nowI,nowJ});
                            }
                        }
                    }

                }
            }
        } else {
            int[][] dir = {{0,1},{1,0},{1,1},{1,-1}};
            for(int i=0;i<n;i++) {
                for(int j=0;j<n;j++) {
                    if(nodes[i][j].c == c) {
                        for(int[] dirs : dir) {
                            int nowI = i + dirs[0];
                            int nowJ = j + dirs[1];

                            if(nowI >= 0 && nowI < n && nowJ >= 0 && nowJ < n && nodes[nowI][nowJ].c == c) {
                                nodes[nowI][nowJ].adj.add(new int[] {i,j});
                                nodes[i][j].adj.add(new int[] {nowI,nowJ});
                            }
                        }
                    }

                }
            }
        }


        int cnt = 0;
        int[] start = new int[2];
        for(int i=0;i<n;i++) {
            for(int j=0;j<n;j++) {
                if(nodes[i][j].c == c) {
                    cnt++;
                    start[0] = i;
                    start[1] = j;
                }
            }
        }



        int[] par = {-1,-1};
        bfs(start, par);

        StringBuilder sb = new StringBuilder();
        if(step.size() != cnt -1) {
            out.println("NO");
            return;
        }

        sb.append("YES\n");

        for(int[] i : step) {
            sb.append(i[0]+" "+i[1]+" "+i[2]+" "+i[3]);
            sb.append('\n');
        }

        out.print(sb.toString());
    }

    static ArrayList<int[]> step = new ArrayList<>();
    static void bfs(int[] now, int[] par) {

        if(!nodes[now[0]][now[1]].sd) {
            nodes[now[0]][now[1]].sd = true;
        } else {
            return;
        }

        for(int i=0;i<nodes[now[0]][now[1]].adj.size();i++) {
            int[] nn = nodes[now[0]][now[1]].adj.get(i);
            if(nn[0] == par[0] && nn[1] == par[1]) {
                continue;
            }
            bfs(nn,now);
        }


        if(par[0] != -1) {
            step.add(new int[] {now[0]+1, now[1]+1, par[0]+1, par[1]+1});
        }

    }

    static class Node {
        char c;
        boolean sd;
        ArrayList<int[]> adj = new ArrayList<>();

        Node(char c) {
            this.c = c;
        }
    }

    static FastReader f = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;

        String next() {
            while(st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch(IOException ioe) {
                    ioe.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int  nextInt() {
            return Integer.parseInt(next());
        }

        double  nextDouble() {
            return Double.parseDouble(next());
        }

        long  nextLong() {
            return Long.parseLong(next());
        }
    }
}