#include<bits/stdc++.h>
using namespace std;
char h[1001][1001]; 
int b[1000][1000];
int mq[1000000];
int n,m,ans,z,f,p;
int fx[4]={0,0,-1,1};
int fy[4]={-1,1,0,0};
bool bbb(int x,int y){
	return x>y;
}
void dfs(int x,int y){
	b[x][y]=1;
	z++;
	f++;	
	for(int i=0;i<4;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&b[tx][ty]==0&&h[tx][ty]=='*'){	
			dfs(tx,ty);
		}
	}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
	for(int j=1;j<=m;j++){
		cin>>h[i][j];
	}
}
for(int i=1;i<=n;i++){
	for(int j=1;j<=m;j++){
		if(h[i][j]=='*'&&b[i][j]==0){
		f=0;
			dfs(i,j);
			mq[p]=f;
			p++;
			ans++;

		}
	}
}
sort(mq,mq+p,bbb);
cout<<ans<<" "<<z<<" "<<mq[0];

	return 0;
}

/**************************************************************
	Problem: 2112
	User: chenyubo
	Language: C++
	Result: Accepted
	Time:54 ms
	Memory:10868 kb
****************************************************************/