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
/*package whatever //do not write package name here */

import java.io.*;
import java.util.*;

public class GFG {
	public static void main (String[] args) {
	Scanner sc=new Scanner(System.in);
	int n=sc.nextInt();
	int m=sc.nextInt();
	
	int count=0,count1=0,f1=0,f2=0;
		for(int i=0;i<n;i++){
	    String s=sc.next();
	     if(s.contains("B"))
		   { f1=i+1;
		      for(int j=0;j<m;j++) 
		      { if(s.charAt(j)=='B')
		          {
		          f2=j+1;
		         break;
		                   }
		  }
		       break;
		   }
		    
		}
	for(int i=f1;i<n;i++){
	    String s=sc.next();
	     if(s.contains("B"))
	          count++;
	  }
	    
	    
	
		//System.out.println(count+1);
			//System.out.println(f1);
				//System.out.println(f2);
			System.out.print((f1+((count+2)/2)-1)+" ");
			
				System.out.println(f2+((count+2)/2)-1);
	}
}