#include <bits/stdc++.h>

#define int long long
using namespace std;

const int N = 1e3 + 5, mod = 1e9 + 7;

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

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

bool vis[N][N];
bool f;

void dfs(int i, int j) {
    vis[i][j] = true;
    f |= a[i][j] == '.';
    for (int k = 0; k < 4; ++k) {
        int x = i + dx[k], y = j + dy[k];
        if (valid(x, y) and !vis[x][y])
            dfs(x, y);
    }
}

void setAnswer(int Case) {
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
        }
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            f = false;
            if (!vis[i][j] and a[i][j] >= 'A' and a[i][j] <= 'Z' and a[i][j] != 'X') {
                dfs(i, j);
                ans += f;
            }
        }
    }
    int loss = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == '.' and !vis[i][j])
                loss++;
        }
    }
    cout << ans << " " << loss;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int testCases = 1;
//    cin >> testCases;
    for (int i = 1; i <= testCases; i++) {
        setAnswer(i);
    }
    return 0;
}