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
#include <bits/stdc++.h>
int n, m;
char map[117][117];
struct cod {
  int r, c;
};
cod findMID(int r, int c) {
  int nc = c;
  while (map[r][nc] == 'B') {
    nc++;
  }
  int nr = r;
  while (map[nr][c] == 'B') {
    nr++;
  }
  return {(nr + r) / 2, (c + nc) / 2};
}
int main() {
  scanf("%d %d\n", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s\n", map[i] + 1);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (map[i][j] == 'B') {
        cod res = findMID(i, j);
        printf("%d %d\n", res.r, res.c);
        return 0;
      }
    }
  }
  return 0;
}
