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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class TestClass {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] s = br.readLine().split(" ");
		int n = Integer.parseInt(s[0]);
		int m = Integer.parseInt(s[1]);
		
		char[][] arr = new char[n][m];
		
		for(int i = 0 ; i < n; i++){
			String sa = br.readLine();
			for(int j = 0; j < m; j++){
				arr[i][j] = sa.charAt(j);
			}
		}
		
		int centerx = 0, centery = 0;
		for(int i = 0 ; i < n; i++){
			for(int j = 0 ;j < m; j++){
				if(arr[i][j] == 'B'){
					int len = findlen(i, j, m, arr);
					int dep = finddep(i, j, n, arr);
					centerx = findcenterx(j, len);
					centery = findcentery(i, dep);
					System.out.println((centery + 1) + " " + (centerx + 1));
					return;
				}
			}
		}
	}

	private static int findcentery(int i, int dep) {
		return i + dep / 2;
	}

	private static int findcenterx(int j, int len) {
		return j + len / 2;
	}

	private static int finddep(int i, int j, int n, char[][] arr) {
		int dep = 0;
		for(int k = i + 1; k < n; k++){
			if(arr[k][j] == 'B')
				dep += 1;
		}
		return dep;
	}

	private static int findlen(int i, int j, int m, char[][] arr) {
		int len = 0;
		for(int k = j + 1; k < m; k++){
			if(arr[i][k] == 'B')
				++len;
		}
		return len;
	}
}
