#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 500 + 5, inf = 2e9;
int n, m;
char a[N][N];

bool checkisQ(int x, int y) {

    if (y - 2 < 0)return false;
    for (int i = 0; i < 5; i++) {
        if (a[x + i][y] != '#') return false;
    }

    for (int i = 0; i <= 2; i++) {
        for (int j = 1; j <= 2; j++) {
            if (i == 1 && j == 1 && a[x + i][y - j] == '#')return false;
            if ((i != 1 || j != 1) && a[x + i][y - j] != '#')return false;
        }
    }

    for (int i = 0; i < 5; i++) {
        a[x + i][y] = '.';
    }
    for (int i = 0; i <= 2; i++) {
        for (int j = 1; j <= 2; j++) {
            if ((i != 1 || j != 1)) {
                a[x + i][y - j] = '.';
            }
        }
    }
    return true;
}

bool checkisF(int x, int y) {

    if (y + 2 >= m)return false;
    for (int i = 0; i < 5; i++) {
        if (a[x + i][y] != '#') return false;
    }

    if (a[x][y + 1] != '#' || a[x][y + 2] != '#' || a[x + 2][y + 1] != '#')return false;

    for (int i = 0; i < 5; i++) {
        a[x + i][y] = '.';
    }
    a[x][y + 1] = a[x][y + 2] = a[x + 2][y + 1] = '.';
    return true;
}

void doWork() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    int q = 0, f = 0;
    for (int j = m - 1; j - 2 >= 0; j--) {
        for (int i = 0; i + 4 < n; i++) {
            if (a[i + 1][j] == '.') {
                f += checkisF(i, j - 2);
            } else {
                q += checkisQ(i, j);
            }
        }
    }
    cout << q << " " << f;
}

int main() {
    IO
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}