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

// region template
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

ll gcd(ll a, ll b) { return __gcd(a, b); }

ll euclid(ll a, ll b, ll &x, ll &y) {
    if (b) {
        ll d = euclid(b, a % b, y, x);
        return y -= a / b * x, d;
    }
    return x = 1, y = 0, a;
}

typedef unsigned long long ull;
typedef long double ld;
ull mod_mul(ull a, ull b, ull M) {
    ll ret = a * b - M * ull(ld(a) * ld(b) / ld(M));
    return ret + M * (ret < 0) - M * (ret >= (ll)M);
}
ull mod_pow(ull b, ull e, ull mod) {
    ull ans = 1;
    for (; e; b = mod_mul(b, b, mod), e /= 2)
        if (e & 1)
            ans = mod_mul(ans, b, mod);
    return ans;
}

const ll mod = 1000000007;
struct Mod {
    ll x;
    Mod(ll xx) : x(xx) {}
    Mod operator+(Mod b) { return Mod((x + b.x) % mod); }
    Mod operator-(Mod b) { return Mod((x - b.x) % mod); }
    Mod operator*(Mod b) { return Mod((x * b.x) % mod); }
    Mod operator/(Mod b) { return *this * invert(b); }
    Mod invert(Mod a) {
        ll x, y, g = euclid(a.x, mod, x, y);
        assert(g == 1);
        return Mod((x + mod) % mod);
    }
    Mod operator^(ll e) {
        if (!e)
            return Mod(1);
        Mod r = *this ^ (e / 2);
        r = r * r;
        return e & 1 ? *this * r : r;
    }
};
// endregion

int isprime(int n) {
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0 && (i % 7 == 1 || i % 7 == 6) && (n / i % 7 == 1 || n / i % 7 == 6)) {
            return false;
        }
    }
    return true;
}

int toint(string s) {
    string b;
    copy_if(all(s), back_inserter(b), [](char c) { return c != ':'; });
    return stoi(b);
}

int main() {
    cin.sync_with_stdio(0);
    cin.tie(0);
    cin.exceptions(cin.failbit);

    const int dir[4][2] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};

    for (;;) {
        int n, m; cin >> n >> m;
        if (!n) break;

        vector<string> mp(m);
        rep(i, 0, m) cin >> mp[i];

        vector<vi> vis(m, vi(n, 0));

        int w = 0, b = 0;

        rep(i, 0, m) rep(j, 0, n) if (!vis[i][j] && mp[i][j] == '.') {
            int color = 0;
            
            queue<pair<int, int>> q;
            q.push({i, j});
            vis[i][j] = 1;

            int cells = 0;
            cells++;

            while (!q.empty()) {
                int x, y;
                tie(x, y) = q.front(); q.pop();

                rep(i, 0, 4) {
                    int nx = x + dir[i][0], ny = y + dir[i][1];
                    if (0 <= nx && nx < m && 0 <= ny && ny < n) {
                        if (mp[nx][ny] == '.' && !vis[nx][ny]) {
                            vis[nx][ny] = 1;
                            q.push({nx, ny});
                            cells++;
                        } else if (mp[nx][ny] == 'W') {
                            color |= 1;
                        } else if (mp[nx][ny] == 'B') {
                            color |= 2;
                        }
                    }
                }
            }

            if (color == 1) {
                w += cells;
            } else if (color == 2) {
                b += cells;
            }
        }

        cout << b << " " << w << endl;
    }
}



Measured memory_bytes: 3176