#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
const int INF = 1e9;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define re(i,a,b) for(int i=(a);i<(b);i++)
const int N = 3e2+5;
int n, m;
int c[N][N];
int dx[5] = {1,-1,0,0};
int dy[5] = {0,0,1,-1};
int getid(int x, int y) {
    return y + (x-1) * m;
}
int fa[N*N], entr[N];
int getfa(int x) {
    return fa[x] == x? x: fa[x]=getfa(fa[x]);
}
int vis[N*N];
int main() {
    cin >> n >> m;
    string s;
    getline(cin, s);
    rep(i,1,n) rep(j,1,m)
        fa[getid(i,j)] = getid(i,j);
    rep(i,1,n) {
        string s;
        getline(cin, s);
        rep(j,1,m) c[i][j] = s[j-1];
        rep(j,1,m) if (c[i][j] >= 'A' && c[i][j] <= 'W') {
            entr[c[i][j]] = getid(i,j);
        }
    }
    rep(i,1,n)rep(j,1,m) {
        if (c[i][j] == 'X') continue;
        int oid = getid(i,j);
        rep(k,0,3) {
            int ni = i+dx[k],nj = j+dy[k];
            if (!(ni>=1 && ni <=n)) continue;
            if (!(nj>=1 && nj <=m)) continue;
            if (c[ni][nj] == 'X') continue;
            if (c[i][j] >= 'A' && c[i][j] <= 'W' && c[ni][nj] >= 'A' && c[ni][nj] <='W') continue;
            int nid = getid(ni,nj);
            if (getfa(nid) != getfa(oid))
                fa[getfa(nid)] = getfa(oid);
        }
    }/*
    rep(i,1,n){
        rep(j,1,m) cout << char(c[i][j]) << getfa(getid(i,j)) << " ";
        cout << endl;
    }*/
    rep(i,1,n)rep(j,1,m) {
        int oid = getfa(getid(i,j));
        if (c[i][j] == '.') vis[oid] = 1;
    }
    int cntblk = 0;
    map<int,int> mp;
    rep(i,1,n)rep(j,1,m){
        int oid = getfa(getid(i,j));
        if (vis[oid]) {
            vis[oid] = 0;
            int gotit = false;
            rep(k, 'A', 'W') if (getfa(entr[k]) == getfa(oid)) gotit = true;
            if (!gotit) mp[oid] = 1; else{
                cntblk ++;
                //cout << i<< " " << j << " "<<  char(c[i][j])<< " " << oid << endl;
            }
        }
    }
    int unreach = 0 ;
    rep (i,1,n) rep(j,1,m) {
        int oid = getfa(getid(i,j));
        if (mp[oid] == 1 && c[i][j] == '.') unreach ++;
    }
    cout << cntblk << " " << unreach;
}