#include<bits/stdc++.h>
using namespace std;
int m,n,ans;
int dx[4]={-1,1,0,0};
int dy[4]={0,0,-1,1};
char a[1010][1010];
int b[1010][1010];
void bfs(int p,int q){
   int x,y,head,tail,i;
   int h[100000][3];
   ans++;
   b[p][q]=0;
   head=0;
   tail=1;
   h[1][1]=p;
   h[1][2]=q; 
   do{
   	head++;
   	for(int i=0;i<=3;i++){
   		x=h[head][1]+dx[i];
   		y=h[head][2]+dy[i];
   		if(x>=0&&x<=m&&y>=0&&y<=n&&b[x][y]){
   			tail++;
   			h[tail][1]=x;
   			h[tail][2]=y;
   			b[x][y]=0;
		   }
	   }
   }
   while(head<tail);
}
int main(){
	//freopen("cell.in","r",stdin);
	//freopen("cell.out","w",stdout);
	cin>>m>>n;
	for(int i=0;i<=m-1;i++){
		for(int j=0;j<=n-1;j++){
			cin>>a[i][j];
			b[i][j]=1;
			if(a[i][j]=='.'){
				b[i][j]=0;
			}
		}
	}
	for (int i=0;i<=m-1;i++)
    for (int j=0;j<=n-1;j++)
      if (b[i][j])bfs(i,j);      
     if(ans<2)
	 {
	 	cout<<"Bad placement.";
	  } 
	  else cout<<"There are "<<ans<<" ships.";
	return 0;
}