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>
using namespace std;
int onbit(int x, int pos) {
  x |= (1 << pos);
  return x;
}
int offbit(int x, int pos) {
  x &= ~(1 << pos);
  return x;
}
int test(int x, int pos) { return x & (1 << pos); }
int flip(int x, int pos) {
  x ^= (1 << pos);
  return x;
}
int lsb(int x) { return x & (-x); }
int onbitall(int x, int pos) {
  x = (1 << pos) - 1;
  return x;
}
const double EPS = 1e-9;
const double PI = 2 * acos(0.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int dx1[] = {0, 1, 0, -1};
const int dy1[] = {1, 0, -1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy2[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int n, m;
char a[1234][1234];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", a[i]);
  int y, x;
  for (int i = 0; i < n; i++) {
    bool br = false;
    for (int j = 0; j < m; j++) {
      if (a[i][j] == 'B') {
        y = i;
        x = j;
        br = true;
        break;
      }
    }
    if (br) break;
  }
  int xx = x;
  int yy = y;
  while (a[y][x] == 'B') {
    x++;
  }
  x = (x - xx) / 2 + xx;
  while (a[y][x] == 'B') {
    y++;
  }
  y = (y - yy) / 2 + yy;
  printf("%d %d\n", y + 1, x + 1);
  return 0;
}
