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 A_Find_Square {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//while(true) {
		int n = sc.nextInt();
		int m = sc.nextInt();
		
		char[][] A = new char[n][m];
		for(int pp = 0 ; pp < n ; pp++) {
			String s = sc.next();
			char[] bb = new char[m];
			bb = s.toCharArray();
			//for(int r = 0 ; r < n ; r++) {
				for(int t = 0 ; t < m ; t++) {
					A[pp][t] = bb[t];
				}
			//}
		}
		int ft = 0 , ct=0;
		int i = 0 , j = 0 , p = 0 , q = 0 , k = 0 , l = 0;
		
		for(i = 0 ; i < n ; i++) {
			for(j = 0 ; j < m ; j++) {
				if(A[i][j] == 'B') {
					ft = 1;
					break;
				}
			}
			if(ft == 1) {
				break;
			}
		}
		if(ft == 0) {
			j = j-1;
			i = i-1;
		}
//		for(k = i ; k < n ; k++) {
//			for(l = j+1 ; l < m ; l++) {
//				if(A[k][l] == 'B') {
//					ct = 1;
//					break;
//				}
//			}
//			if(ct == 1) {
//				break;
//			}
//		}
//		if(ct == 0) {
//			k = k-1;
//			l = l-1;
//		}
		for(k = n-1 ; k >= 0 ; k--) {
			for(l = m-1 ; l >= 0 ; l--) {
				if(A[k][l] == 'B') {
					ct = 1;
					break;
				}
			}
			if(ct == 1) {
				break;
			}
		}
		//System.out.println(i +" " + j +" "+ k +" "+ l);
		
//		int ii = (int) Math.ceil((i+i + l-j)/(l-j))+1;
//		int jj = (int) Math.ceil((j+l)/(l-j))+1;
//		System.out.println(ii +" "+ jj);
		int tt = (k-i +1)/2;
		int ii = i + tt+1;
		int jj = j + tt+1;
		System.out.println(ii +" "+ jj);
	
	//}
	}

}
