#include<bits/stdc++.h>
using namespace std;
char a[110][110];
int n,t,c,ma;
int m,s; 
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
void dfs(int x,int y){
	a[x][y]='~';
	t++;
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[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>>a[i][j];
    	}
    }
    
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		if(a[i][j]=='*'){
    			c++;
    			t=0;
    			dfs(i,j);
    			s=s+t;
    			ma=max(ma,t);
    		}
    	}
    }
    cout<<c<<" "<<s<<" "<<ma;
	return 0;
}

/**************************************************************
	Problem: 2112
	User: zengdongxin
	Language: C++
	Result: Accepted
	Time:53 ms
	Memory:2084 kb
****************************************************************/