Solutions to this problem:
http://codeforces.com/contest/1028/problem/A

Solution in C

#include <stdio.h>
#include <stdlib.h>

int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	char **table = (char **)malloc(sizeof(char*)*(n));
	for(int i=0;i<n;++i)
	{
		table[i] = (char *)malloc(sizeof(char)*(m+1));
		scanf("%s",table[i]);
	}
	int side=0,r,c;
	for(int i=0;i<n;++i)
	{
		for(int j=0;j<m;++j)
		{
			if(table[i][j] == 'B')
			{
				if(side == 0)
				r = i,c = j;
				side++;
			}
		}
		if(side)
		break;
	}
	r = side/2 + 1 + r ;
	c = side/2 + 1 + c ;
	printf("%d %d\n",r,c);
	return 0;
}

------------------------------------------------------------
Solution in Gnu C++14

#include<bits/stdc++.h>
using namespace std;
int X,Y,n,m,cnt;char s[1005];
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		scanf("%s",s+1);
		for (int j=1;j<=m;j++)
			if (s[j]=='B') cnt++,X+=i,Y+=j;
	}
	X/=cnt;Y/=cnt;
	printf("%d %d\n",X,Y);
	return 0;
}

------------------------------------------------------------
Solution in Java 8

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class JavaClass {
	public static void main(String[] args){
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int m=s.nextInt();
		String[] arr=new String[n];
		for(int j=0;j<n;j++){
			arr[j]=s.next();
		}
		int c=0;
		int count=0;
		boolean cs=false;
		int counts=0;
		int startc=Integer.MIN_VALUE;
		int startr=Integer.MIN_VALUE;
		boolean rs=false;
		for(int i=0;i<n;i++){
			String temp=arr[i];
			rs=false;
			for(int j=0;j<m;j++){
				if(temp.charAt(j)=='B'){
					count++;
					rs=true;
					if(startc==Integer.MIN_VALUE){
						startc=j;
					}
				}
			}
			if(rs){
				counts++;
				cs=true;
				if(startr==Integer.MIN_VALUE)
				startr=i;
			}
		}
		System.out.println((1+startr+counts/2)+" "+(count/(2*counts)+startc+1));
	}
}

------------------------------------------------------------
Solution in Java 8

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            int xSum = 0;
            int ySum = 0;
            int count = 0;
            for (int i = 0; i < n; i++) {
                String s = in.next();
                for (int j = 0; j < m; j++) {
                    if (s.charAt(j) == 'B') {
                        xSum += j;
                        ySum += i;
                        count++;
                    }
                }
            }
            out.println((ySum / count + 1) + " " + (xSum / count + 1));
        }

    }

    static class InputReader {
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private void fillTokenizer() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            fillTokenizer();
            return tokenizer.nextToken();
        }

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

    }
}


------------------------------------------------------------
Solution in Python 3

n, m = map(int, input().split())
x, y = -1, -1
for i in range(n):
    s = input()
    if (x == -1 and y == -1):
        d1 = s.find('B')
        d2 = s.rfind('B')
        if (d1 != -1 and d2 != -1):
            x = (d2 - d1) // 2 + 1 + i
            y = (d2 - d1) // 2 + 1 + d1
            print(x, y)

------------------------------------------------------------
Solution in Python 3

n, m = map(int, input().split())
a = []
for i in range(n):
    s = input()
    a.append(s)
h = 0
ind1 = 0
ind2 = 0
for i in range(0, len(a)):
    if a[i].find("B") != -1:
        h += 1
        ind1 = a[i].find("B") + 1
        ind2 = i + 1
if h % 2 == 0:
    h -= 1
print(ind2 - h // 2, ind1 + h // 2)

------------------------------------------------------------
Solution in Ocaml

open Printf
open Scanf

let read_int _ = bscanf Scanning.stdib " %d " (fun x -> x)
let read_string _ = bscanf Scanning.stdib " %s " (fun x -> x)
let () = 
  let n = read_int () in
  let m = read_int () in
  let board = Array.init n read_string in

  let next (i,j) = if j<m-1 then (i,j+1) else (i+1,0) in

  let rec scan (i,j) tot xtot ytot =
    if i=n then (tot,xtot,ytot)
    else if board.(i).[j] = 'B' then
      scan (next (i,j)) (tot+1) (xtot+i) (ytot+j)
    else scan (next (i,j)) tot xtot ytot
  in

  let (tot,xtot,ytot) = scan (0,0) 0 0 0 in

  printf "%d %d\n" (1+xtot/tot) (1+ytot/tot)