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
//package ContestAIMTech;

import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class aimA {
    public static Scanner enter = new Scanner(System.in);
    public static PrintWriter out = new PrintWriter(System.out);
    public static void main(String[] args) {
        int n=enter.nextInt();
        int m=enter.nextInt();
        String[] mass=new String[n+1];
        for (int i = 0; i <n ; i++) {
            mass[i]=enter.next();
        }
        char[] arr=new char[m];
        Arrays.fill(arr,'W');
        mass[n]=new String(arr);
        int k=-1,l=-1,stroka=-1,last=-1;
        for (int i = 0; i <n+1 ; i++) {
                if(k==-1) k=mass[i].indexOf('B');
                if(l==-1) l=mass[i].lastIndexOf('B');
                if(k!=-1 && stroka==-1) stroka=i;
                if(stroka!=-1 && !mass[i].contains("B") && last==-1) last=i-1;
        }
        out.println(((stroka+last)/2+1)+" "+((l+k)/2+1));
        out.close();
    }
}
