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);
        int n,m;
        //int firstRowPos=0,lastRowPos=0,firstColumnPos=0,lastColumnPos=0;
        //boolean lastColumnBlack=false,lastRowBlack=false;
        n=sc.nextInt();
        m=sc.nextInt();
        //System.out.println(n+"\t"+m);
        char grid[][] = new char[115][115];
        boolean isFirstB=true;
        int row=0,column=0;
        String temp="";
        for(int i=0;i<n;i++)
        {
            temp=sc.next();
            for(int j=0 ;j<m;j++)
            {
                grid[i][j]=temp.charAt(j);
                if(isFirstB&&temp.charAt(j)=='B')
                {
                    row=i;
                    column=j;
                    isFirstB=false;
                }
                //System.out.println("All good");
            }

            sc.nextLine();
        }
        //System.out.println(row+"\t"+column);
        int i=row,j=column;
        for(;i<n && grid[i][column]=='B' ; i++);
        for(;j<m && grid[row][j]=='B';j++);
        if(i!=n)
            i--;
        if(j!=m)
            j--;
        row=(row+i)/2+1;
        column=(column+j)/2+1;

        System.out.println(row+" "+column);


    }

}
