#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
}
const int N = 1005;
int n,m;
char c[N][N];
char s[6][6] = {
{'#','#','#','#','#','#'},
{'#','#','.','.','#','#'},
{'#','.','.','.','.','#'},
{'#','.','.','.','.','#'},
{'#','#','.','.','#','#'},
{'#','#','#','#','#','#'},
};
int cnt1, cnt2;
bool check(int i, int j){
    for(int x = 0; x <= 5; x++){
        for(int y = 0; y <= 5; y++){
            if(c[i + x][j + y] != s[x][y]) return false;
        }
    }
    return true;
}
int main(){
    read(n), read(m);
    for(int i = 1; i <= n; i++) scanf("%s", c[i] + 1);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cnt2 += c[i][j] == '#';
        }
    }
    for(int i = 1; i <= n - 5; i++){
        for(int j = 1; j <= m - 5; j++){
            cnt1 += check(i, j);
        }
    }
    for(int num1 = 0; num1 <= cnt1; num1++){
        if((cnt1 - num1) % 2 != 0) continue;
        int num2 = (cnt1 - num1) / 2;
        if(num1 * 100 + num2 * 146 == cnt2){
            printf("%d %d", num2, num1);
            return 0;
        }
    }
    assert(0);
    return 0;
}