#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define momen ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define ld long double
#define fp(n) for(int i=0;i<n;i++)
#define fp1(n) for(int i=1;i<=n;i++)
#define all(v) v.begin() , v.end()
const int mod = 1e9 + 7, N = 100 + 5, M = 8e6 + 5;
const ll LG = 20, inf = 1e9 + 6;


int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

string grid[N] ;
int n,m ;
bool vis[N][N] ;

bool valid(int i ,int j){
    if (i<0 || i>=n || j<0 || j>=m || vis[i][j] || (grid[i][j]>='A' && grid[i][j]<='Z')  )
        return 0 ;
    return 1;
}

int dfs(int i, int j){
    if (!valid(i ,j))
        return 0 ;
    vis[i][j] = 1 ;
    int ret = (grid[i][j] == '.') ;
    for (int k = 0; k < 4; ++k) {
        int x = i +dx[k]  , y = j +dy[k];
        ret+=dfs(x,y) ;
    }
    return ret ;
}


void solve(int z) {
    cin>>n>>m;
    string s ;
    cin.ignore() ;
    vector<pair<int ,int>>q ;
    int dots = 0 ;
    for (int i = 0; i < n; ++i) {
        getline(cin , s) ;
        grid[i] = s ;
        for (int j = 0; j < m; ++j) {
            if (grid[i][j] >= 'A' && grid[i][j] <= 'W')
                q.push_back({i,j}) ;
            if (grid[i][j] == '.')
                dots++ ;
        }
    }
    int ans = 0 , sum = 0 ;
    for (auto i :q) {
        int ctr = 0 ;
        if (!vis[i.first][i.second]) {
            for (int j = 0; j < 4; ++j) {
                ctr+= dfs(i.first + dx[j], i.second + dy[j]);
            }
        }
        if (ctr)
            sum+=ctr , ans++ ;
    }
    cout<<ans<<" "<<dots - sum  ;

}


int main() {
    momen
    int t = 1;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
//    cin >> t;

    for (int i = 1; i <= t; ++i) {
        //cout<<"Case #"<<i<<": ";
        solve(t);
    }

    return 0;
}