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;
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  unordered_map<long long, long long> mp;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i, j, k, n, m, count = 0, sum = 0, x, y, z, c, b[150002] = {0}, t,
                           ans;
  string s, s1, s2, s3, a[200];
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long flag = 0;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      if (a[i][j] == 'B') {
        x = i + 1;
        y = j + 1;
        flag = 1;
      }
      if (flag == 1) break;
    }
    if (flag == 1) break;
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      if (a[i][j] == 'B') {
        count++;
      }
    }
  }
  long long kk = sqrt(count);
  cout << (x + (kk / 2)) << ' ' << (y + (kk / 2)) << endl;
}
