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.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Codeforces1028A {
    public static void main(String[] args) throws Exception {
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tokenizer = new StringTokenizer(input.readLine());
        int n = Integer.parseInt(tokenizer.nextToken());
        int m = Integer.parseInt(tokenizer.nextToken());
        char[][] val = new char[n][];
        for (int i = 0; i < n; i++) {
            val[i] = input.readLine().toCharArray();
        }

        int s = -1;
        int e = -1;
        TH:
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (val[i][j] == 'B') {
                    s = i;
                    e = j;
                    break TH;
                }

            }
        }

        if (s != -1) {
            int xcount = 0;
            int ycount = 0;
            for (int i = s; i < n; i++) {
                if (val[i][e] == 'B')
                    xcount++;
            }

            for (int i = 0; i < m; i++) {
                if (val[s][i] == 'B')
                    ycount++;
            }

            s++;
            e++;

            if (xcount != 1)
                s += Math.ceil(xcount / 2.0) - 1;
            if (ycount != 1)
                e += Math.ceil(ycount / 2.0) - 1;

            System.out.println(s + " " + e);
        }
    }
}
