#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;
int w, h;
int dxy[5] = {-1, 0, 1, 0, -1};
bool bb[60][60], ww[60][60], visited[60][60];
void dfs1(int y, int x, vector<string>&field){

    if(visited[y][x]) return;

    ww[y][x] = true;
    visited[y][x] = true;

    for(int i=0; i<4; ++i){
        int ny = y + dxy[i],
            nx = x + dxy[i+1];
        if(ny < h && ny>=0 && nx < w && nx >= 0 && field[ny][nx] == '.'){
            dfs1(ny, nx, field);
        }
    }
}

void dfs2(int y, int x, vector<string>&field){

    if(visited[y][x]) return;

    bb[y][x] = true;
    visited[y][x] = true;

    for(int i=0; i<4; ++i){
        int ny = y + dxy[i],
                nx = x + dxy[i+1];
        if(ny < h && ny>=0 && nx < w && nx >= 0 && field[ny][nx] == '.'){
            dfs2(ny, nx, field);
        }
    }
}
int main() {
    //cout << fixed << setprecision(15);


    while(cin >> w >> h) {
        if (w == 0 && h == 0) break;

        vector<string> field;

        REP(i, h) {
            string str;
            cin >> str;
            field.push_back(str);
        }
        REP(i, 60) {
            REP(j, 60) {
                ww[i][j]=false;
                bb[i][j]=false;
                visited[i][j] = false;
            }
        }

        REP(i, h) REP(j, w) {
                if (field[i][j] == 'W') {
                    dfs1(i, j, field);
                }
            }
        REP(i, 60) {
            REP(j, 60) {
                visited[i][j] = false;
            }
        }

        REP(i, h) REP(j, w) {
                if (field[i][j] == 'B') {
                    dfs2(i, j, field);
                }
        }

        int cnt_b=0, cnt_w=0;

        REP(i, h){
            REP(j, w){
                if(field[i][j]=='.' && bb[i][j] && !ww[i][j]) cnt_b++;
                else if(field[i][j]=='.' && !bb[i][j] && ww[i][j]) cnt_w++;
            }
        }

        cout << cnt_b << " " << cnt_w << endl;
    }
    return 0;
}


Measured memory_bytes: 3164