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 = raw_input()
# n = int(n)
inp = list(map(int,raw_input().split()))
n = inp[0]
m = inp[1]
rows = "*"
for f in range(n):
	x = raw_input()
	rows += x
ans = 0	
for f in range(m*n+1):
	if rows[f] == "B":
		val = f
		val += m
		count = 0
		while val <= m*n:
			if rows[val] == "B":
				count += 1
			else:
				break
			val += m
		# print(count)	
		ans = f + m*(count/2) + (count/2)
		break
# print(ans)
if ans % m != 0:
	row = int(ans/m) + 1
else:
	row = ans/m
if ans % m != 0:
	col = int(ans%m) 
else:
	col = m
print(str(row) + " " + str(col))			
		# val = f
		# val -= n
		# while val >= 0:
		# 	if rows[val] == "B":
		# 		count += 1
		# 	else:
		# 		break
		# 	val -= n
		# val = f
		# val -= 1
		# while val-1%m != 0:
		# 	if rows[val] == "B":
		# 		horc += 1
		# 	else:
		# 		break
		# 	val += 1
		# val = f
		# val -= 1	
		# while val%m != 0:
		# 	if rows[val] == "B":
		# 		horc += 1
		# 	else:
		# 		break	


