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
//package codechef;
 
import java.io.BufferedReader;
import java.util.Scanner;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
 
public class MarchCook2 {
	int INF = (int) 1e9;
	int MOD = 1000000007;
 
	void solve(InputReader in, PrintWriter out) throws IOException {
		int n = in.nextInt();
		int m = in.nextInt();
		int r=-1;
		int c=-1;
		String s[] = new String[n];
		for(int i=0;i<n;i++){
			s[i] = in.next();
			for(int j=0;c==-1 && j<m;j++){
				if(s[i].charAt(j) == 'B'){
					c=j;
					r=i;
					break;
				}
			}
		}
		int x = 1;
		while(x+r<n && s[x+r].charAt(c)=='B'){
			x++;
		}
		r+=x/2;
		x=1;
		while(c+x<m && s[r].charAt(c+x)=='B'){
			x++;
		}
		c+=x/2;
		System.out.println((r+1)+" "+(c+1));
	}
 
	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
		int t = 1;//in.nextInt();
		while (t-- > 0) {
			new MarchCook2().solve(in, out);
		}
		out.close();
	}
 
	static class InputReader {
		static BufferedReader br;
		static StringTokenizer st;
 
		public InputReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}
 