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;
const int mod = 1000;
const int maxn = 120;
template <class T>
inline bool scan_d(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
inline void out(long long x) {
  if (x > 9) out(x / 10);
  putchar(x % 10 + '0');
}
char s[maxn][maxn];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  bool check = false;
  int sx = n + 1, sy = n + 1, ex = 0, ey = 0;
  for (int i = 0; i < n; ++i) {
    scanf(" %s", s[i]);
    for (int j = 0; j < m; ++j)
      if (s[i][j] == 'B') {
        if (i + 1 < sx || j + 1 < sy) sx = i + 1, sy = j + 1;
        if (i + 1 > ex || j + 1 > ey) ex = i + 1, ey = j + 1;
      }
  }
  printf("%d %d\n", (sx + ex) / 2, (sy + ey) / 2);
  return 0;
}
