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
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  h,w=LI()
  field=[S() for _ in range(h)]

  sm=0
  for x in field:
    sm+=x.count('B')

  if sm==1:
    for i in range(h):
      for j in range(w):
        if field[i][j]=='B':
          return str(i+1)+' '+str(j+1)

  sm=int(math.sqrt(sm))
  sm-=1
  sm//=2

  for i in range(h):
    for j in range(w):
      a=i+sm
      b=j+sm
      c=i-sm
      d=j-sm

      if 0<=a<h and 0<=b<w and 0<=c<h and 0<=d<w:
        if field[a][j]=='B' and field[c][j]=='B' and field[i][b]=='B' and field[i][d]=='B':
          return str(i+1)+' '+str(j+1)

# main()
print(main())
