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.BufferedInputStream;
import java.util.*;
public class Solution {

	public static void main(String[] args) {
				// TODO Auto-generated method stub
				Scanner scan = new Scanner(System.in);
				BufferedInputStream br=new BufferedInputStream(System.in);
				int n = scan.nextInt();
				int m = scan.nextInt();
				char[][] A = new char[n][m];
				for(int i=0;i<n;i++){
						A[i] = scan.next().toCharArray();
					}
				int colS = 0;
				int colE = 0;
				int rowS =0;
				boolean flag = false;
				for(int row=0;row<n;row++){
					for(int col=0;col<m;col++){
						if(A[row][col]=='B'){
							if(!flag){
								colS = col;
								rowS = row;
								flag = true;
								colE = colS;
							}else {
								colE = col ;
							}
						}
					}
					if(flag)break;
				}
				int length = colE - colS +1;
				System.out.printf("%d %d",rowS + length/2 +1,colS + length/2 +1);
			}
	}