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;
vector<long long> prime_mods = {
    1000000000108174411LL, 1000000000108174427LL, 1000000000108174433LL,
    1000010000005470301LL, 1000010000005470329LL, 1000010000005470341LL,
};
int n;
long long mod = 1e9 + 7;
vector<int> w;
int wu(int a, int b) {
  int wu = 0;
  bitset<12> A(a), B(b);
  for (int i = 0; i < n; i++) {
    if (A[i] == B[i]) wu += w[i];
  }
  return wu;
}
vector<int> af() { return {1, 2, 3}; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  int mni = n, mnj = m, mxi = 1, mxj = 1;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < m; j++) {
      if (s[j] == 'B') {
        if (i + 1 < mni) mni = i + 1;
        if (i + 1 > mxi) mxi = i + 1;
        if (j + 1 < mnj) mnj = j + 1;
        if (j + 1 > mxj) mxj = j + 1;
      }
    }
  }
  cout << (mxi + mni) / 2 << " " << (mxj + mnj) / 2 << endl;
  return 0;
}
