#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;
typedef __int128 bigInt;

using namespace std;

const int N = 100 + 5, INF = 1e9 + 5, mod = 1e9 + 7, LOG = 21, SQ = 500;

int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n, m;
string a[N];

struct DSU{
    int par[N * N], sz[N * N], l[N * N], d[N * N];

    void init(int k){
        for(int i = 0; i < k; i++) {
            int r = i / m, c = i % m;
            par[i] = i, sz[i] = 1;
            l[i] = (a[r][c] >= 'A' and a[r][c] <= 'W');
            d[i] = a[r][c] == '.';
        }
    }

    int findPar(int v){
        return (par[v] == v ? v : par[v] = findPar(par[v]));
    }

    void join(int u, int v){
        u = findPar(u), v = findPar(v);

        if(u == v)
            return;

        if(sz[u] < sz[v])
            swap(u, v);

        par[v] = u;
        sz[u] += sz[v];
        l[u] += l[v];
        d[u] += d[v];
    }
}dsu;

bool valid(int i, int j) {
    return i >= 0 and i < n and j >= 0 and j < m and a[i][j] != 'X';
}

void doWork() {
    cin >> n >> m;
    cin.ignore();

    for (int i = 0; i < n; i++) {
        getline(cin, a[i]);
    }

    dsu.init(n * m);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (!valid(i, j)) {
                continue;
            }

            for (int k = 0; k < 4; k++) {
                int nx = i + dx[k], ny = j + dy[k];
                if (valid(nx, ny)) {
                    if (a[i][j] >= 'A' and a[i][j] <= 'W' and a[nx][ny] >= 'A' and a[nx][ny] <= 'W') {
                        continue;
                    }

                    dsu.join(i * m + j, nx * m + ny);
                }
            }
        }
    }

    int ans = 0, dots = 0;
    unordered_set<int> vis;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (!valid(i, j)) {
                continue;
            }

            int par = dsu.findPar(i * m + j);
            if (vis.find(par) != vis.end()) {
                continue;
            }

            vis.insert(par);
            int l = dsu.l[par], d = dsu.d[par];
            if (l and d) {
                ans++;
            }
            else if (d) {
                dots += d;
            }
        }
    }

    cout << ans << ' ' << dots << el;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tests = 1;
//    cin >> tests;
    for (int i = 1; i <= tests; i++) {
        doWork();
    }
}