#include<cstdio>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int INF=1e9;
int n,m,cnt,tot,num[1005][1005],tt,dt[1000002],maxx[1000002],minx[1000002],maxy[1000002],miny[1000002];
char ch[1005][1005];
bool fl[1002][1002],bj[1000002];
void dfs(int x,int y){
	if (fl[x][y] || ch[x][y]!='.')return;
	if (x==1 || x==n || y==1 || y==m)bj[cnt]=1;
	fl[x][y]=1;num[x][y]=cnt;dt[cnt]++;
	minx[cnt]=min(minx[cnt],x);
	miny[cnt]=min(miny[cnt],y);
	maxx[cnt]=max(maxx[cnt],x);
	maxy[cnt]=max(maxy[cnt],y);
	if (x-1>=1)dfs(x-1,y);
	if (x+1<=n)dfs(x+1,y);
	if (y-1>=1)dfs(x,y-1);
	if (y+1<=m)dfs(x,y+1);
}
bool iskong(int num){
	return (maxx[num]-minx[num]==3 && maxy[num]-miny[num]==3 && dt[num]==12);
}
int main()
{
	for (int i=1;i<=1000000;i++)
	{
		maxx[i]=maxy[i]=-INF;
		minx[i]=miny[i]=INF;
	}
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)scanf("%s",ch[i]+1);
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	if (!fl[i][j] && ch[i][j]=='.')
	{
		cnt++;dfs(i,j);
	}
	for (int i=1;i<=cnt;i++)if (!bj[i] && iskong(i))tt++;
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	if (!bj[num[i][j]] && ch[i][j]=='.' && iskong(num[i][j]))
	{
		if (i-4>=1 && ch[i-4][j]=='.' && iskong(num[i-4][j]))tot++;
		if (i+4<=n && ch[i+4][j]=='.' && iskong(num[i+4][j]))tot++;
		if (j-4>=1 && ch[i][j-4]=='.' && iskong(num[i][j-4]))tot++;
		if (j+4<=m && ch[i][j+4]=='.' && iskong(num[i][j+4]))tot++;
	}
	printf("%d %d\n",tot/4,tt-tot/2);
	return 0;
}