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.math.*;
import java.io.*;

public class A {
	public A() {
		FS scan = new FS();
		int minx = Integer.MAX_VALUE, maxx = 0;
		int miny = Integer.MAX_VALUE, maxy = 0;
		int r = scan.nextInt(), c = scan.nextInt();
		char[][] grid = new char[r][c];
		for(int i = 0 ; i < r ; i++)
			grid[i] = scan.next().toCharArray();
		for(int i = 0 ; i < r ; i++) {
			for(int j = 0 ; j < c ; j++) {
				if(grid[i][j] == 'B') {
					minx = Math.min(minx, i);
					maxx = Math.max(maxx, i);
					miny = Math.min(miny, j);
					maxy = Math.max(maxy, j);
				}
			}
		}
		System.out.println((((minx + maxx) / 2) + 1) + " " + (((miny + maxy) / 2) + 1));
	}
	class FS {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		public String next() {
			while(!st.hasMoreTokens()) {
				try { st = new StringTokenizer(br.readLine()); }
				catch(Exception e) { e.printStackTrace(); }
			}
			return st.nextToken();
		}
		public int nextInt() { return Integer.parseInt(next()); }
		public long nextLong() { return Long.parseLong(next()); }
		public double nextDouble() { return Double.parseDouble(next()); }
	}
	public static void main(String[] args) { new A(); }
}
