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.*;

public class test {

  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    int m = in.nextInt();
    int mdlN = 0;
    int mdlM = 0;
    boolean flag = false;
    boolean flag2 = false;
    int i = 1;
    while (i < n + 1) {
      String s = in.next();
      int b = s.indexOf('B') + 1;
      if (b > 0) {
      	if (!flag) {
              mdlM = b;
              mdlN = i;
      	  flag = true;
      	  char[] charArray = s.toCharArray();
      	  int k = b + 1; 
      	  while (k < m) {
      	    if (charArray[k] != 'B') {
      	  	mdlM = (k -1 == mdlM)? mdlM: (((k -1) - mdlM) / 2) + mdlM;
      	  	k = m;
      	    } else if (k + 2 > m - 1) {
      	      mdlM = (((k + 1) - mdlM) / 2) + mdlM;	
      	    }
      	    k = k + 2;
      	  }		
      	}
      	i++;
	
      } else {
        if (flag) {
        	mdlN = (i -1 == mdlN)? mdlN: ((i - 1) - mdlN)/2 + mdlN;
        	flag2 = true;
        	break;
        } else {
        	i++;
        }	
      }
    }
    if (!flag2) {
    	mdlN = (n - mdlN)/2 + mdlN;
    }

    System.out.print(mdlN + " " + mdlM);    	
  }
}

