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

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

    static final class TaskA {
        private int rows;
        private int cols;
        private char[][] table;

        public void solve(int __, InputReader in, PrintWriter out) {
            rows = in.nextInt();
            cols = in.nextInt();
            table = in.nextCharTable(rows, cols);
            for (int x = 0; x < rows; ++x) {
                for (int y = 0; y < cols; ++y) {
                    if (table[x][y] != 'B') continue;
                    for (int len = 0; len < Math.min(rows, cols); ++len) {
                        if (good(x, y, len) && bad(x, y, len + 1)) {
                            out.println((x + 1) + " " + (y + 1));
                            return;
                        }
                    }
                }
            }
            throw new IllegalStateException("POLUNDRA");
        }

        private boolean good(int x, int y, int len) {
            return check(x - len, y) && check(x + len, y) && check(x, y - len) && check(x, y + len);
        }

        private boolean bad(int x, int y, int len) {
            return !check(x - len, y) && !check(x + len, y) && !check(x, y - len) && !check(x, y + len);
        }

        private boolean check(int x, int y) {
            return isValidCell(x, y) && table[x][y] == 'B';
        }

        private boolean isValidCell(int x, int y) {
            return 0 <= x && x < rows && 0 <= y && y < cols;
        }

    }

    static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public char[][] nextCharTable(int rows, int columns) {
            char[][] table = new char[rows][];
            for (int i = 0; i < rows; ++i) {
                table[i] = next().toCharArray();
                assert table[i].length == columns;
            }
            return table;
        }

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

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(readLine());
            }
            return tokenizer.nextToken();
        }

        public String readLine() {
            String line;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

    }
}

