#include<bits/stdc++.h>
using namespace std;
int sum;
int dx[5]={0,1,-1,0,0};
int dy[5]={0,0,0,1,-1};
int ans[5001][5001];
bool vis[5001][5001];
int r,c;
int kk[5001][5001];
bool k=0,t=0,p=0,s=0;
void dfs(int x,int y){
	vis[x][y]=1;
	kk[x][y]=sum;
	for(int i=1;i<=4;i++){
		int xx=x+dx[i];
		int yy=y+dy[i];
		if(xx>=1 && yy>=1 && xx<=r && yy<=c &&ans[xx][yy]==1){
			if(kk[xx][yy]==sum) return ;
			else if(vis[xx][yy]==1 ){
				k=1;
				t=1;
				return ;
			}
			else dfs(xx,yy);
		}
	}
}
int main(){
	cin>>r>>c;
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			char a;
			cin>>a;
			if(a=='#') ans[i][j]=1;
			else ans[i][j]=0;
		}
	}
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			if(ans[i][j]==1) s=1;
			if(ans[i][j]==0) p=1;
		}
	}
	if(s==0){
		 cout<<"There are 0 ships."; 
		 return 0;
	}
	if(p==0) {
		 cout<<"There are 1 ships.";
		 return 0;
	}
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			if(t==1 && k==1) {
				cout<<"Bad placement.";
				return 0;
			}
			else if(ans[i][j]==1 && vis[i][j]==0){
				dfs(i,j);
				sum++;
			}
		}
	}
	if(t==1 && k==1) cout<<"Bad placement.";
	cout<<"There are "<<sum<<" ships.";
}