#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int w,h;
string s[55];
bool vis[55][55];
int cnt;
int flag;
int d[5]={-1,0,1,0,-1};

void dfs(int i,int j){
	vis[i][j]=true;
	cnt++;
	rep(dd,5){
		int ni=i+d[dd],nj=j+d[dd+1];
		if(ni<0||ni>=h||nj<0||nj>=w)continue;
		if(s[ni][nj]=='B'){
			flag|=1;
		}else if(s[ni][nj]=='W'){
			flag|=2;
		}else if(!vis[ni][nj]&&s[ni][nj]=='.'){
			dfs(ni,nj);
		}
	}
}

int main(){
	cin.sync_with_stdio(false);
	while(1){
		cin>>w>>h;
		if(h==0)break;
		rep(i,h){
			cin>>s[i];
		}
		memset(vis,0,sizeof(vis));
		int res[4];
		memset(res,0,sizeof(res));
		rep(i,h)rep(j,w){
			if(vis[i][j]||s[i][j]!='.')continue;
			cnt=flag=0;
			dfs(i,j);
			res[flag]+=cnt;
		}
		cout<<res[1]<<" "<<res[2]<<endl;
	}
	return 0;
}