#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int inf = (int)1e9;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<string> a;
  a.resize(n);
  for (auto i = 0; i < n; ++i) cin >> a[i];
  int lx = inf, ly = inf, rx = -inf, ry = -inf;
  for (auto i = 0; i < n; ++i) {
    for (auto j = 0; j < m; ++j) {
      if (a[i][j] == 'W') continue;
      if (i < lx || (i == lx && j < ly)) {
        lx = i;
        ly = j;
      }
      if (i > rx || (i == rx && j > ry)) {
        rx = i;
        ry = j;
      }
    }
  }
  int h = (rx - lx + 1) / 2;
  cout << lx + 1 + h << ' ' << ly + 1 + h << endl;
  return 0;
}
