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.io.*;
public class B{
	public static void main(String[] args)
	{
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = fs.nextInt(); int m = fs.nextInt();
		char[][] arr = new char[n][m];
		List<Integer> rows = new ArrayList();
		List<Integer> cols = new ArrayList();
		int[] visrow = new int[n];
		int[] viscol = new int[m];
		for(int i=0;i<n;i++)
		{
			String str = fs.next();
			for(int j=0;j<m;j++)
			{
				arr[i][j] = str.charAt(j);
				if(arr[i][j] == 'B')
				{
					if(visrow[i] == 0)
					{
						rows.add(i);
						visrow[i] = 1;
					}
					if(viscol[j] == 0)
					{
						cols.add(j);
						viscol[j] = 1;
					}
				}
			}
		}
		Collections.sort(rows);
		Collections.sort(cols);
//		out.println(rows);
//		out.println(cols);
		int sz = rows.size();
		int rans = rows.get(sz/2);
		int cans = cols.get(sz/2);
		out.println((rans+1)+" "+(cans+1));
		out.close();
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
	public static int[] sort(int[] arr)
	{
		List<Integer> temp = new ArrayList();
		for(int i:arr)temp.add(i);
		Collections.sort(temp,Collections.reverseOrder());
		int start = 0;
		for(int i:temp)arr[start++]=i;
		return arr;
	}
}