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.*;
public class FindSquare {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in); 
		int n = scan.nextInt();
		int m = scan.nextInt();
		char[][] A = new char[n][m];
		scan.nextLine();
		for(int i = 0; i < n; i++) {
			String S = scan.nextLine();
			for(int j = 0; j < m; j++) {
				A[i][j] = S.charAt(j); 
			}
		}
		
	//	for(char[] c : A) {
	//		System.out.println(Arrays.toString(c));
	//	}
		
		int x1 = 0;
		int x2 = 0;
		int y1 = 0;
		int y2 = 0; 
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				if(A[i][j] == 'B') {
					x1 = i+1;
					y1 = j+1;
					break;
				}
			}
		}
		for(int i = n-1; i >= 0; i--) {
			for(int j = m-1; j >= 0; j--) {
				if(A[i][j] == 'B') {
					x2 = i+1;
					y2 = j+1;
					break;
				}
			}
		}
		int resX = (x1 + x2)/2;
		int resY = (y1 + y2)/2;
		

		System.out.println(resX + " " + resY);
	}

}
