#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <cstdio>
#include <climits>
#include <cmath>
#include <array>
#include <functional>
#include <sstream>
#include <list>
#include <set>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double eps=1e-9;
const int inf=1e9;
typedef pair<int,int> P;
struct Point
{
  double x,y;
  Point(){x=0;y=0;}
  Point(double d_x,double d_y){x=d_x,y=d_y;}
  double operator*(Point obj){return obj.x*x+obj.y*y;}
  double operator%(Point obj){return obj.y*x-obj.x*y;}
  Point operator*(double b){Point tmp;tmp.x=x*b;tmp.y=y*b;return tmp;}
  Point operator/(double b){Point tmp;tmp.x=x/b;tmp.y=y/b;return tmp;}
  Point operator+(Point obj){Point tmp;tmp.x=x+obj.x;tmp.y=y+obj.y;return tmp;}
  Point operator-(){Point tmp;tmp.x=-x;tmp.y=-y;return tmp;}
  Point operator-(Point obj){Point tmp;tmp.x=x-obj.x;tmp.y=y-obj.y;return tmp;}
  Point operator-=(Point obj){x-=obj.x;y-=obj.y;return *this;}
  Point operator+=(Point obj){x+=obj.x;y+=obj.y;return *this;}
  Point operator/=(double b){x=x/b;y=y/b;return *this;}
  Point operator*=(double b){x=x*b;y=y*b;return *this;}
  double size(){return hypot(x,y);}
  Point unit(){return Point(x/size(),y/size());}
  Point normal(){return Point(y,-x);}
  double atan(){return atan2(y,x);}
};

bool operator<(Point a,Point b){return a.x!=b.x?a.x<b.x:a.y<b.y;}
bool operator>(Point a,Point b){return b<a;}
bool operator<=(Point a,Point b){return !(b<a);}
bool operator>=(Point a,Point b){return !(a<b);}
bool operator==(Point a,Point b){return (a-b).size()<eps;}
bool operator!=(Point a,Point b){return !(a==b);}

bool equal(double a,double b){return abs(a-b)<eps;}
double cross(Point a,Point b){return a%b;}
double dot(Point a,Point b){return a*b;}

int ccw(Point a,Point b,Point c)
{
  b=b-a;
  c=c-a;
  if(b%c>0) return +1;
  else if(b%c<0)return -1;
  else if(b*c<0) return +2;
  else if(b.size()<c.size()) return -2;
  else return 0;
}


int w,h;
bool black[55][55];
bool white[55][55];
string field[55];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};

void solve(int x,int y,char c)
{
  if((c=='B' && black[y][x]) || (c=='W' && white[y][x])) return;
  if(c=='W' && field[y][x]!='W') white[y][x]=true;
  else if(c=='B' && field[y][x]!='B') black[y][x]=true;
  for(int i=0;i<4;i++)
    {
      int nx=x+dx[i];
      int ny=y+dy[i];
      if(0<=nx && nx<w && 0<=ny && ny<h && field[ny][nx]=='.')
	{
	  solve(nx,ny,c);
	}
    }
}

int main(int argc,char const* argv[])
{
  while(1)
    {
      memset(black,false,sizeof(black));
      memset(white,false,sizeof(white));
      cin >> w >> h;
      if(!w)break;
      for(int i=0;i<h;i++)
	{
	  cin >> field[i];
	}
      for(int i=0;i<h;i++)
	{
	  for(int j=0;j<w;j++)
	    {
	      if(field[i][j]=='W')
		{
		  solve(j,i,'W');
		}
	      else if(field[i][j]=='B')
		{
		  solve(j,i,'B');
		}
	    }
	}
      int blackcount=0,whitecount=0;
      for(int i=0;i<h;i++)
	{
	  for(int j=0;j<w;j++)
	    {
	      if(black[i][j] && !white[i][j]) blackcount++;
	      else if(!black[i][j] && white[i][j]) whitecount++;
	    }
	}
      cout << blackcount << ' ' << whitecount << endl;
    }
  return 0;
}



Measured memory_bytes: 3092