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 java.io.*;
import java.util.*;

public class Solution {

    public static void main(String args[])
    {
        FastReader sc=new FastReader();
        int i=0,j=0,k=0;
        /*int t=sc.nextInt();

        for (int testcase=0;testcase<t;testcase++){}
        List<Integer> sta=new ArrayList<>();*/
        int rows=sc.nextInt();
        int cols=sc.nextInt();
        char arr[][]=new char[rows][cols];
        boolean black=false;
        int bi=0;
        int bj=0;
        int blackrows=0;
        int blackcount=0;
        int blackcols=0;
        for (i=0;i<rows;i++)
        {
            String temp=sc.nextLine();
            for (j=0;j<cols;j++)
            {
                arr[i][j]=temp.toCharArray()[j];
                if (!black && arr[i][j]=='B')
                {
                    bi=i;
                    bj=j;
                    black=true;
                }

                if (black && arr[i][j]=='B')
                {
                    if (i==bi)
                        blackcols++;
                    if (j==bj)
                        blackrows++;
                    blackcount++;
                }
            }
        }
        if (blackcount==1)
        {
            System.out.println((bi+1)+" "+(bj+1));
        }
        else
        {
            int indi=bi+(blackrows)/2;
            int indj=bj+(blackcols)/2;
            System.out.println((indi+1)+" "+(indj+1));
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}