#include<bits/stdc++.h>
using namespace std;
const int N = 1009;
char mp[N][N];
int vis[N][N],circle;
int siz[20009],poi[20009][2];
int n,m,S,C,tot,sum;


int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};

char O[6][6] = {"#..#",
			    "....",
			    "....",
			    "#..#"};
int check(int x,int y){
	for(int i = 0;i < 4;i++){
		for(int j = 0;j < 4;j++){
			if(O[i][j] != mp[x+i][y+j])
				return 0;
		}
	}
	return 1;
}
void dfs(int x,int y){
	vis[x][y] = tot;
	siz[tot]++;
	for(int i = 0;i < 4;i++){
		int tx = x+dx[i],ty = y+dy[i];
		if(tx<1||tx>n||ty<1||ty>m) continue;
		if(vis[tx][ty]||mp[x][y] != mp[tx][ty])continue;
		dfs(tx,ty);
	}
}

int main(){
	cin.tie(NULL)->sync_with_stdio(false);
	cin >> n >> m;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			cin >> mp[i][j];
		}
	}
	
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			if(vis[i][j])continue;
			//printf("(%d,%d)",i,j);
			tot++;
			poi[tot][0] = i;
			poi[tot][1] = j;
			dfs(i,j);
			sum += siz[tot]*(mp[i][j] == '#');
			if(mp[i][j] == '.'&&siz[tot] == 12 && check(poi[tot][0],poi[tot][1]-1))
				circle ++;
		}
	}
	cerr << circle <<","<<sum;
	C = (100*circle - sum)/54;
	S = circle - 2*C;
	cout << C <<" "<< S;
	return 0;
}