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 M[116][116];
int FL(int k, int m) {
  int sum = 0;
  for (int i = 0; i < m; i++) {
    if (M[k][i] == 0) sum++;
  }
  return sum;
}
int FH(int k, int n) {
  int sum = 0;
  for (int i = 0; i < n; i++) {
    if (M[i][k] == 0) sum++;
  }
  return sum;
}
int main() {
  int n, m;
  char s;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> s;
      if (s == 'W')
        M[i][j] = 1;
      else
        M[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    M[i][m] = FL(i, m);
  }
  for (int i = 0; i < m; i++) {
    M[n][i] = FH(i, n);
  }
  int x, y;
  for (int i = 0; i < n; i++) {
    if (M[i][m] != 0) {
      x = (i + (M[i][m] + i - 1)) / 2;
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    if (M[n][i] != 0) {
      y = (i + (M[n][i] + i - 1)) / 2;
      break;
    }
  }
  cout << x + 1 << ' ' << y + 1 << endl;
  return 0;
}
