#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
const int mod = 998244353;
int n, m;
char mp[maxn][maxn];
int main() {
  cin >> n >> m;
  int u = n + 1, b = 0;
  pair<int, int> lu, rb;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      cin >> mp[i][j];
      if (mp[i][j] == 'B' && i < u) {
        u = i;
        lu.first = i, lu.second = j;
      }
      if (mp[i][j] == 'B' && i >= b) {
        b = i;
        rb.first = i, rb.second = j;
      }
    }
  }
  cout << (lu.first + rb.first) / 2 << ' ' << (lu.second + rb.second) / 2
       << endl;
}
