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.HashMap;
import java.util.Map;

/**
 *
 * @author Ahmed_Naser
 */
public class FindSquare {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
      
          java.util. Scanner in = new java.util.Scanner(System.in);
          
          
          int n = in.nextInt() , m = in.nextInt();
          
          char arr[][] = new char[n][m];
          
          boolean mark = true ;
          
          for (int i = 0; i < n; i++) {
            String str = in.next();
              for (int j = 0; j < m; j++) {
                 arr[i][j] = str.charAt(j);
               
              }
           
        }
          
           for (int i = 0; i < n; i++) {
          
              for (int j = 0; j < m; j++) {
                  
                 if(arr[i][j] == 'B')
                 {
                     int x = i , y = j , count = 0 , index = 0; 
                     HashMap<Integer,Integer> map = new HashMap();
                   //  map.put(index, 1);
                     while(x < n && arr[x][y] != 'W')
                     {
                         count = 0 ; 
                         while(y < m && arr[x][y] != 'W')
                         {
                           map.put(index, ++count);
                           ++y ; 
                         }
                         ++x; 
                         y = j ; 
                         ++index ; 
                     }
                     
                    
                     for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
                         Integer key = entry.getKey();
                         Integer value = entry.getValue();
                      
                         if(value % 2 == 0)
                         {
                             mark = false ;
                         }
                         
                     }
                     
                     if(mark)
                     {
                         ++i ; 
                         int mid = i + (map.size() )/ 2 ;
                         j++;
                        
                        System.out.println(mid+" "+((map.get(mid%map.size())/2) + j));
                         
                         return;
                     }
                   
                     
                 }               
              }
           
        }
           
    }
    
}
