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.util.Scanner;

public class FindSquare {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            String[] str = sc.nextLine().split(" ");
            int r = Integer.parseInt(str[0]);
            int c = Integer.parseInt(str[1]);
            char[][] arr = new char[r][c];
            for (int i = 0; i < r; i++) {
                String line = sc.nextLine();
                for (int j = 0; j < c; j++) {
                    arr[i][j] = line.charAt(j);
                }
            }

            boolean isFound = false;
            for (int i = 0; i < r && !isFound; i++) {
                for (int j = 0; j < c; j++) {
                    if(arr[i][j] == 'B'){
                        int count = 0;
                        for(int jj = j;jj<c && arr[i][jj]=='B'; jj++){
                            count++;
                        }
                        count--;
                        System.out.println(((i+1)+count/2) +" "+((j+1)+count/2));
                        isFound = true;
                        break;
                    }
                }
            }
        }
    }
}
