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.Scanner;

public class Main {
	static int N = 120;
	static String[] maps = new String[N];
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
			Scanner scan = new Scanner(System.in);
			int n, m;
			while(scan.hasNextInt())
			{
				n = scan.nextInt();
				m = scan.nextInt();
				int minr = n, maxr = 1;
				int minc = m, maxc = 1;
				for (int i = 1; i <= n; i++)
				{
					maps[i] = scan.next();
					for (int j = 0; j < m; j++)
					{
						if(maps[i].charAt(j) == 'B')
						{
							minr = min(minr,i);
							maxr = max(maxr,i);
							maxc = max(maxc,j);
							minc = min(minc,j);
						}
					}
				}
				System.out.println((minr + maxr) / 2 + " " + (minc + maxc + 2) / 2);
			}
			scan.close();
	}

	private static int max(int maxr, int i) {
		// TODO Auto-generated method stub
		return maxr > i ? maxr : i;
	}

	private static int min(int minr, int i) {
		// TODO Auto-generated method stub
		return minr > i ? i : minr;
	}

}
