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>
int main() {
  int m, n;
  scanf("%d", &m);
  scanf("%d", &n);
  char arr[m][n];
  int row, col;
  char B;
  for (row = 0; row < m; row++) {
    for (col = 0; col < n; col++) {
      scanf(" %c", &arr[row][col]);
    }
  }
  int lastrow = -1;
  int lastcol = -1;
  int found = -1;
  int firstrow = -1;
  int firstcol = -1;
  for (row = 0; row < m; row++) {
    for (col = 0; col < n; col++) {
      if (arr[row][col] == 'B') {
        firstrow = row;
        firstcol = col;
        found = 1;
        break;
      }
    }
    if (found == 1) {
      break;
    }
  }
  firstrow = firstrow + 1;
  firstcol = firstcol + 1;
  printf("\n");
  for (row = 0; row < m; row++) {
    for (col = 0; col < n; col++) {
      if (arr[row][col] == 'B') {
        lastrow = row;
        lastcol = col;
      }
    }
  }
  lastrow = lastrow + 1;
  lastcol = lastcol + 1;
  printf("%d %d", (firstrow + lastrow) / 2, (firstcol + lastcol) / 2);
}
