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.*;
import java.io.*;
public class kanak{
	public static void main(String[] args) {
		FastScanner fi=new FastScanner();
		int n,m,i,j;
		n=fi.nextInt();
		m=fi.nextInt();
		char[][] mat=new char[n][m];
		int x,y,len;
		x=y=-1;
		len=0;
		boolean flag=true;
		boolean f2=true;
		for (i=0;i<n ;i++){
			String s=fi.next();
			for (j=0;j<m;j++){
			      mat[i][j]=s.charAt(j);
			  }         
		}
		for (i=0;i<n ;i++){
			for (j=0;j<m;j++){
			     if (mat[i][j]=='B' && flag) {
			     	if (x==-1 && y==-1) {
			     		x=i;
			     		y=j;
			     	}
			     	len++;
			     }
			  }   
			  if(len > 0 && flag) {
			  	flag=!flag;      	
			  }      
		}
	    double  e =  (double)Math.ceil(((double) len /(double)2));
		x=x+(int) e;
		y=y+(int) e;
		System.out.println( x + " " + y);





	}
}
class FastScanner{
	BufferedReader br;
	StringTokenizer st;
	FastScanner(){
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	public String next(){
		while(st==null || !st.hasMoreTokens()){
			try{
				st=new StringTokenizer(br.readLine());
			}
			catch(IOException e){
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}
	public int nextInt(){
		return Integer.parseInt(next());
	}
	public long nextLong(){
		return Long.parseLong(next());
	}
}