// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1010;
int n, m, s, ss;
string t[N];
string st[] = {
"##########",
"##########",
"##########",
"####..####",
"###....###",
"###....###",
"####..####",
"##########",
"##########",
"##########"
};
signed main() {
	cin.tie(0) -> sync_with_stdio(0); // don't use puts
	cin >> n >> m;
	F(i, 1, n) {
		cin >> t[i];
		t[i] = ' ' + t[i];
		s += count(all(t[i]), '#');
	}
	F(i, 1, n - 9)
		F(j, 1, m - 9) {
			bool flag = true;
			F(a, 0, 9)
				F(b, 0, 9)
					if (t[i + a][j + b] != st[a][b]) {
						flag = false;
						break;
					}
			ss += flag;
			// if (flag) debug << i << " " << j << endl;
		}
	// F(i, 2, n - 3)
	// 	F(j, 2, m - 3)
	// 		if (t[i][j] == '#' && t[i][j + 1] == '.' && t[i + 1][j] == '.' && t[i - 1][j - 1] == '#' && t[i - 1][j] == '#' && t[i][j - 1] == '#' && t[i + 1][j + 1] == '.' && t[i - 1][j + 1] == '#' && t[i + 1][j - 1] == '#' && t[i + 3][j] == '#' && t[i + 3][j + 1] == '.' && t[i + 2][j - 1] == '#' && t[i + 3][j - 1] == '#' && t[i + 2][j] == '.' && t[i + 2][j + 1] == '.') ss++;
	debug << s << "  " << ss << endl;
	int a = (ss * 100 - s) / 54;
	// debug << s - ss * 50 << endl;
	int b = ss - 2 * a;
	cout << a << ' ' << b;
	// F(i, 0, 1e6)
	// 	F(j, 0, 1e6)
	// 		if (i * 146 + j * 100 == s) {
	// 			cout << i << " " << j;
	// 			return 0;
	// 		}
	return 0;
}
/* why?
*/