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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
 
{
   public static long pow(long a, long b)
    {
        long result=1;
        while(b>0)
        {
            if (b % 2 != 0)
            {
                result=(result*a);
                b--;
            } 
            a=(a*a);
            b /= 2;
        }   
                return result;
    }
    public static long fact(long num)
    {
                long fact=1;
				int i=0;
                for(i=1; i<=num; i++)
                {
                    fact=fact*i;
                }
                return fact;
            }
            public static long gcd(long a, long b)
            {
                if (a == 0)
                    return b;
                return gcd(b%a, a);
            }
            
            public static long lcm(int a,int b)
            {
                return a * (b / gcd(a, b));
            }
            public static long sum(int h)
            {
                return (h*(h+1)/2);
            }
			public static void dfs(int parent,boolean[] visited)
			{
				ArrayList<Integer> arr=new ArrayList<Integer>();
				arr=graph.get(parent);
				visited[parent]=true;
				for(int i=0;i<arr.size();i++)
				{
					int num=arr.get(i);
					if(visited[num]==false)
					{
						dfs(num,visited);
					}
					else
					{
						
					}
				}
			}
			static int[] storing1;
			static int[] storing2;
			static ArrayList<ArrayList<Integer>> graph;
			static InputReader in=new InputReader(System.in);
        	static OutputWriter out=new OutputWriter(System.out);
        	public static long Long()
			{
				String s=in.String();
				return Long.parseLong(s);
			}
			public static void pln(String value)
			{
				System.out.println(value);
			}
			public static void main(String args[])throws IOException
            {
            //	long a=pow(26,1000000005);
        	 //   BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        	    ArrayList<Integer> index=new ArrayList<>();
				ArrayList<Integer> index1=new ArrayList<>();
				ArrayList<Character> ar2=new ArrayList<>();
				TreeSet<Integer> ts=new TreeSet<>();
				TreeSet<Integer> ts1=new TreeSet<>();
				HashMap<Integer,Integer> hash=new HashMap<Integer,Integer>();
				int n=in.Int();
				int m=in.Int();
				char[][] a=new char[n][m];
				for(int i=0;i<n;i++)
				{
					String s=in.String();
					for(int j=0;j<s.length();j++)
					{
						a[i][j]=s.charAt(j);
					}
				}
				int count=0;
				int flag=0;
				for(int i=0;i<n;i++)
				{
					for(int j=0;j<m;j++)
					{
						if(a[i][j]=='B' && count==0)
						{
							index.add(i);
							index1.add(j);
							count++;
							flag=1;
						}
						if(j+1<m && a[i][j]=='B' && a[i][j+1]=='W')
						{
							index.add(i);
							index1.add(j);
							count=-1;
							flag=1;
							break;
						}
						else if(a[i][j]=='B' && j==m-1)
						{
							index.add(i);
							index1.add(j);
							count=-1;
							flag=1;
							break;
						}
					}
					if(flag==1)
						break;
					count=0;
				}
				int fin=0,fin1=0;
				for(int j=index.get(0);j<n;j++)
				{
					if(j+1<n && a[j][index1.get(0)]=='B' && a[j+1][index1.get(0)]=='W')
					{
						fin=j;
						fin1=index1.get(0);
					}
					else if(a[j][index1.get(0)]=='B' && j==n-1)
					{
						fin=j;
						fin1=index1.get(0);
					}
				}
				int ans=0;
				if(index1.size()==1)
				{
					ans=index1.get(0);
				}
				else
					ans=(index1.get(0)+index1.get(1))/2;
				int ans1=(index.get(0)+fin)/2;
				pln((ans1+1)+" "+(ans+1));
            }
        }
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
         
        class InputReader {
        	 
        	private InputStream stream;
        	private byte[] buf = new byte[1024];
        	private int curChar;
        	private int numChars;
        	private SpaceCharFilter filter;
         
        	public InputReader(InputStream stream) {
        		this.stream = stream;
        	}
         
        	public int read() {
        		if (numChars== -1)
        			throw new InputMismatchException();
        		if (curChar >= numChars) {
        			curChar = 0;
        			try {
        				numChars = stream.read(buf);
        			} catch (IOException e) {
        				throw new InputMismatchException();
        			}
        			if (numChars <= 0)
        				return -1;
        		}
        		return buf[curChar++];
        	}
        	public int Int() {
        		int c = read();
        		while (isSpaceChar(c))
        			c = read();
        		int sgn = 1;
        		if (c == '-') {
        			sgn = -1;
        			c = read();
        		}
        		int res = 0;
        		do {
        			if (c < '0' || c > '9')
        				throw new InputMismatchException();
        			res *= 10;
        			res += c - '0';
        			c = read();
        		} while (!isSpaceChar(c));
        		return res * sgn;
        	}
         
        	public String String() {
        		int c = read();
        		while (isSpaceChar(c))
        			c = read();
        		StringBuilder res = new StringBuilder();
        		do {
        			res.appendCodePoint(c);
        			c = read();
        		} while (!isSpaceChar(c));
        		return res.toString();
        	}
         
        	public boolean isSpaceChar(int c) {
        		if (filter != null)
        			return filter.isSpaceChar(c);
        		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        	}
         
        	public String next() {
        		return String();
        	}
         
        	public interface SpaceCharFilter {
        		public boolean isSpaceChar(int ch);
        	}
        }
         
        class OutputWriter {
        	private final PrintWriter writer;
         
        	public OutputWriter(OutputStream outputStream) {
        		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        	}
         
        	public OutputWriter(Writer writer) {
        		this.writer = new PrintWriter(writer);
        	}
         
        	public void print(Object...objects) {
        		for (int i = 0; i < objects.length; i++) {
        			if (i != 0)
        				writer.print(' ');
        			writer.print(objects[i]);
        		}
        	}
         
        	public void printLine(Object...objects) {
        		print(objects);
        		writer.println();
        	}
         
        	public void close() {
        		writer.close();
        	}
         
        	public void flush() {
        		writer.flush();
        	}
         
        	}
         
            class IOUtils {
         
        	public static int[] readIntArray(InputReader in, int size) {
        		int[] array = new int[size];
        		for (int i = 0; i < size; i++)
        			array[i] = in.Int();
        		return array;
        	}
         
        	}  