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 main() {
  int r, c;
  cin >> r >> c;
  string* row;
  row = new string[r];
  for (int i = 0; i < r; i++) cin >> row[i];
  int c1 = 0, c2 = 0, r1 = 0, r2 = 0;
  int i = 0;
  for (i = 0; i < r; i++) {
    if (row[i].find('B') != -1) {
      c1 = row[i].find('B') + 1;
      for (int k = c1; k < c; k++) {
        if (row[i].find('B', k) != -1) c2 = row[i].find('B', k) + 1;
      }
      r1 = i + 1;
      if (c2 == 0) c2 = c1;
      break;
    }
  }
  for (i + 1; i < r; i++) {
    if (row[i].find('B') == -1) {
      r2 = i;
      break;
    }
    r2 = i;
  }
  int k = 0;
  if ((r2 + r1) % 2 != 0) k = 1;
  int h = 0;
  if ((c2 + c1) % 2 != 0) h = 1;
  cout << (r2 + r1) / 2 + k << " " << (c2 + c1) / 2 + h;
  return 0;
}
