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
n,m = map(int,input().split())
l = []
for i in range(n):
	l.append(list(input()))

for i in range(m):
	if l[0][i] == 'W':
		l[0][i] = 0
	else:
		l[0][i] = 1

for i in range(1,n):
	if l[i][0] == 'W':
		l[i][0] = 0
	else:
		l[i][0] = 1

oddmax = [0,0,0]
for i in range(1,n):
	for j in range(1,m):

		if l[i][j] == 'B':
			l[i][j] = 1
		else:
			l[i][j] = 0

		if l[i][j-1] is not 0 and l[i-1][j] is not 0 and  l[i-1][j-1] is not 0 and l[i][j] is not 0:
			l[i][j] = l[i-1][j-1] + 1
		
		oddmax = [l[i][j],i,j] if l[i][j] > oddmax[0] and l[i][j] %2 is 1 else oddmax


if oddmax[0] == oddmax[1] == oddmax[2] == 0:
	if 1 not in l[0]:
		o = 0
		for i in range(1,n):
			if l[i][0] == 1:
				o = i
				#print(o)
				break
		print(o+1,1)
	else:
		#print('-sdfgh-')
		print(1,l[0].index(1)+1)
else:
	print(oddmax[1]+1-oddmax[0]//2,oddmax[2]+1-oddmax[0]//2)