#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

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

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 100 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

int n, m, cnt;
string arr[N];
bool vis[N][N];

bool valid(int x, int y) {
    return x >= 0 && x < n && y >= 0 && y < m && !vis[x][y] && (arr[x][y] == '.' || arr[x][y] == ' ');
}

void dfs(int x, int y) {
    vis[x][y] = true;
    cnt += arr[x][y] == '.';
    for (int i = 0; i < 4; ++i) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (valid(nx, ny))dfs(nx, ny);
    }
}

void solve() {
    cin >> n >> m;
    cin.ignore();
    for (int i = 0; i < n; ++i) {
        getline(cin, arr[i]);
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (vis[i][j] || arr[i][j] == '.' || arr[i][j] == ' ' || arr[i][j] == 'X')continue;
            cnt = 0;
            dfs(i, j);
            ans += cnt > 0;
        }
    }
    int ans2 = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (!vis[i][j] && arr[i][j] == '.')ans2++;
        }
    }
    cout << ans << ' ' << ans2;
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}