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

public class Inversion_count {

    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int row = input.nextInt();
        int col = input.nextInt();
        Character arr[][] = new Character[row][col];
        String x = "";
        for (int i = 0; i < row; i++) {
            x = input.next();
            for (int j = 0; j < col; j++) {
                arr[i][j] = x.charAt(j);
            }
        }
        int fx = -1;
        int count = -1;
        int i=0;
        int j=0;
        for ( i = 0; i < row&&fx==-1; i++) {
            for ( j = 0; j < col; j++) {
                if (arr[i][j] == 'B') {
                    fx=i;
                    count = find_count(arr, i, j);
                    break;
                }
            }
        }
      //  System.out.println(j+"   "+count);
        //System.out.println(i);
        System.out.println((fx+1+count/2)+" "+((j+1)+count/2));
    }

    private static int find_count(Character arr[][], int i, int j) {
        int count = 1;
        //System.out.println(i);
       // System.out.println(j);
        for (; ++i < arr.length;) {
          //  System.out.println(i+  "  "+j);
            if (arr[i][j] == 'B') {
                count++;
            } else {
                return count;
            }
        }
        return count;
    }
}
