/*

Author: Haze

2024/3/24

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int n = read(), m = read();
    vector<string> a(n);
    set<int> s;
    irep(i, 0, n - 1) {
        cin >> a[i];
    }
    irep(i, 0, n - 1) {
        irep(j, 0, m - 1) {
            if (a[i][j] == '#')s.emplace(j * n + i);
        }
    }
    int F = 0, Q = 0;
    vector<array<int, 2>> patF = {
            {0, 0},
            {0, 1},
            {0, 2},
            {1, 0},
            {2, 0},
            {2, 1},
            {3, 0},
            {4, 0}
    };
    vector<array<int, 2>> patQ = {
            {0, 0}, {0, 1}, {0, 2}, {1, 0}, {1, 2}, {2, 0}, {2, 1}, {2, 2}, {3, 2}, {4, 2}
    };
    while (s.size()) {
        int P = *s.begin();
        int y = P / n, x = P % n;
        int isF = 1;
        for (auto [dx, dy]: patF) {
            if(!s.contains((y + dy) * n + x + dx)){
                isF = 0;
                break;
            }
        }
        if(isF){
            ++ F;
            for (auto [dx, dy]: patF) {
                s.erase((y + dy) * n + x + dx);
            }
        }
        else{
            ++ Q;
            for (auto [dx, dy]: patQ) {
                s.erase((y + dy) * n + x + dx);
            }
        }
    }
    cout << Q << ' ' << F;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}
/*
12 5
###..
#.###
###.#
#.###
#####
.#..#
.##..
.####
.##.#
..###
....#
....#

 2 2
 */