Consider a table of size n × m, initially fully white. Rows are numbered 1 through n from top to bottom, columns 1 through m from left to right. Some square inside the table with odd side length was painted black. Find the center of this square.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 115) — the number of rows and the number of columns in the table.

The i-th of the next n lines contains a string of m characters s_{i1} s_{i2} … s_{im} (s_{ij} is 'W' for white cells and 'B' for black cells), describing the i-th row of the table.

Output

Output two integers r and c (1 ≤ r ≤ n, 1 ≤ c ≤ m) separated by a space — the row and column numbers of the center of the black square.

Examples

Input

5 6
WWBBBW
WWBBBW
WWBBBW
WWWWWW
WWWWWW


Output

2 4


Input

3 3
WWW
BWW
WWW


Output

2 1
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            char[][] array = new char[n][m];
            for (int i = 0; i < n; i++) {
                String str = in.next();
                for (int j = 0; j < m; j++) {
                    array[i][j] = str.charAt(j);
                }
            }
            int startRow = 0;
            int endRow = -1;
            int startCol = 0;
            int endCol = 0;
            boolean isstarted = false;
            boolean isEndColFound = false;
            label:
            for (int i = 0; i < n; i++) {
                boolean isBFoundInRow = false;
                for (int j = 0; j < m; j++) {
                    if (!isstarted && array[i][j] == 'B') {
                        startRow = i + 1;
                        startCol = j + 1;
                        isstarted = true;
                    }
                    if (isstarted && !isEndColFound && array[i][j] != 'B') {
                        endCol = j + 1;
                        isEndColFound = true;
                    }
                    if (isstarted && array[i][j] == 'B') {
                        isBFoundInRow = true;
                    }
                }
                if (isstarted && !isEndColFound) {
                    endCol = m;
                    isEndColFound = true;
                }
                if (isstarted && !isBFoundInRow) {
                    endRow = i;
                    break label;
                }
                if (i == n - 1 && endRow == -1) {
                    endRow = n;
                }
            }

            if (endRow - startRow >= 2) startRow = startRow + (endRow - startRow) / 2;
            if (endCol - startCol >= 2) startCol = startCol + (endCol - startCol) / 2;
            out.print(startRow + " " + startCol);
        }

    }
}

