#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 300 + 5;

int n, m;
bool vis[N][N];
int dxF[] = {-1, -1, 0, 0, -1, -1, 0, 0};
int dyF[] = {0, 0, 1, -1, 0, 0, 1, 1};
int dxQ[] = {-1, -1, -1, -1, 0, 0, 1, 1, 0};
int dyQ[] = {0, 0, 0, 0, -1, -1, 0, 0, 1};

bool valid(int x, int y) {
    return x >= 0 && x < n && y >= 0 && y < m;
}

void testCase() {
    cin >> n >> m;

    char g[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++)
            cin >> g[i][j];
    }

    int a = 0, b = 0;
    for (int i = n - 1; i >= 0; i--) {
        for (int j = 0; j < m; j++) {
            if (g[i][j] == '.' || vis[i][j])
                continue;

            int x = i, y = j;

            for (int k = 0; k < 9; k++) {
                x += dxQ[k], y += dyQ[k];

                if (!valid(x, y) || g[x][y] == '.' || vis[x][y])
                    break;
            }

            if (valid(x, y) && g[x][y] == '#' && !vis[x][y]) {
                a++;

                x = i, y = j;

                vis[x][y] = 1;

                for (int k = 0; k < 9; k++) {
                    x += dxQ[k], y += dyQ[k];

                    vis[x][y] = 1;
                }
            }

            x = i, y = j;

            for (int k = 0; k < 8; k++) {
                x += dxF[k], y += dyF[k];

                if (!valid(x, y) || g[x][y] == '.' || vis[x][y])
                    break;
            }

            if (valid(x, y) && g[x][y] == '#' && !vis[x][y]) {
                b++;

                x = i, y = j;

                vis[x][y] = 1;

                for (int k = 0; k < 8; k++) {
                    x += dxF[k], y += dyF[k];

                    vis[x][y] = 1;
                }
            }
        }
    }

    cout << a << ' ' << b;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}