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.*;
import java.lang.*;

public class Main {

        public static void main(String[] args) {

                Scanner sc = new Scanner(System.in);

                int n = sc.nextInt();
                int m = sc.nextInt();

                String[] arr = new String[n];

                int f1 = 0;
                int l1 = 0;

                int side = 0 ;
                
                for ( int i = 0 ; i < n ; i++ ) {

                        arr[i] = sc.next();
                        
                }
                
                boolean flag = false ;

                for ( int i = 0 ; i < n ; i ++ ) {

                        f1 = arr[i].indexOf("B");

                        if ( f1 != -1 ) {

                                l1 = arr[i].lastIndexOf("B");

                                side = l1 - f1 + 1;
                                
                                flag = l1 == f1 ? true : false;

                                l1 = f1 ;

                                f1 = i;
                                
                                break;

                        }

                }
                
                if ( flag ) {
                	
                	System.out.println((f1+1)+" "+(l1+1)) ;
                	
                } else {

	                side = (side+1) >>1;
	                
	                l1 = l1 + side ;
	                
	                f1 = f1 + side ;
	                
	                System.out.println( f1 + " " + l1);
                
                }
        }

}