#include<bits/stdc++.h>
using namespace std;
char a[1005][1005]; 
int sx,sy,ex,ey,n,m,cnt1,cnt2=1;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
struct p
{
	int x,y;
};
queue <p> q;
void bfs(int x,int y)
{
	sx=ex=x;
	sy=ey=y;
	cnt2=1;
	q.push((p){x,y});
	a[x][y]='1';
	while(!q.empty())
	{
		p now=q.front();
		q.pop();
		x=now.x;
		y=now.y;
		sx=min(x,sx);
		sy=min(y,sy);
		ex=max(x,ex);
		ey=max(y,ey);
		for(int i=0;i<4;i++)
		{
			if(a[x+dx[i]][y+dy[i]]=='#')
			{
				a[x+dx[i]][y+dy[i]]='1';
				cnt2++; 
				q.push((p){x+dx[i],y+dy[i]});
			}
		}
	}
}
int main()
{
	scanf("%d%d",&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);
				cnt1++;
			}
			if((ex-sx+1)*(ey-sy+1)!=cnt2)
			{
				printf("Bad placement.");
				return 0;
			}
		}
	}
	printf("There are %d ships.",cnt2);
    return 0;
}