#include<bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
struct node
{
	int x,y;
};
int n,m,dp[N],ans[N],tot,maxn,cnt,sum,tmp=1;
char a[N][N];
bool vis[N][N];
int dx[] = {0,0,1,-1,1,-1,1,-1};
int dy[] = {1,-1,0,0,1,-1,-1,1};
void bfs(int sx,int sy)
{
	sum = 1;
	queue<node> q;
	node cur = {sx,sy};
	q.push(cur);
	while(q.empty() == 0)
	{
		cur = q.front();
		q.pop();
		int x = cur.x,y = cur.y;
		for(int i=0;i<=7;i++)
		{
			int nx = x + dx[i];
			int ny = y + dy[i];
			if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && !vis[nx][ny] && a[nx][ny] == '*')
			{
				sum++;
				vis[nx][ny] = 1;
				a[nx][ny] = '.';
				node tmp = {nx,ny};
				q.push(tmp);
			}
		}
	}
}
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] == '*')
			{
				bfs(i,j);
				ans[++tot] = sum;
			}
		}
	}
	sort(ans+1,ans+tot+1);
	int b = 1;
	for(int i=1;i<=tot;i++)
	{
		if(ans[i] == ans[b])
		{
			dp[tmp] += ans[i];
			b = i;
		}
		else
		{
			tmp++;
			b = i;
		}
	}
	for(int i=1;i<=tmp;i++)
		maxn = max(maxn , dp[i]);
	cout<<tmp<<" "<<maxn;
	return 0;
}