#include<iostream>
#include<cstdio>
//#define int long long
using namespace std;
const int N=1e3+501;
int n,m,l,ll;
int a[N][N],b[N][N],block[N*N],bel[N*N],last[N*N];
int ans,maxn,kkknb=1;
int dx[8]={0,-1,1,-1,1,0,-1,1};
int dy[8]={-1,-1,-1,0,0,1,1,1};
inline int read(){
	char ch=getchar();
	while(ch!='.'&&ch!='*') ch=getchar();
	if(ch=='*') return 1;
	return 0;
}
inline int che(int x,int y){return x<=n&&x>=1&&y<=m&&y>=1&&!b[x][y]&&a[x][y];}
void dfs(int x,int y){
	b[x][y]=1;
	for(int i=0;i<8;i++){
		int nx=x+dx[i],ny=y+dy[i];
		if(che(nx,ny)){
			kkknb++;
			dfs(nx,ny);
		}
	}	
}
int main(){
	freopen("star.in","r",stdin);
	freopen("star.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			a[i][j]=read();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(!b[i][j]&&a[i][j]){
				dfs(i,j);
				block[++l]=kkknb;
				kkknb=1;
			}
		}
	}
	for(int i=1;i<=l;i++){
		if(bel[i]) continue;
		bel[i]=++ans;last[ans]+=block[i];
		maxn=max(maxn,last[ans]);
		for(int j=i+1;j<=l;j++)
			if(block[j]==block[i]) last[ans]+=block[j],bel[j]=bel[i],maxn=max(maxn,last[ans]); 
	}
	printf("%d %d",ans,maxn);
	return 0;
}