#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 1e3 + 10;
char g[N][N];
int n, m;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

void dfs (int x, int y)
{
	g[x][y] = '.';
	for (int i=0; i < 4; i ++)
	{
		int a = x + dx[i], b = y + dy[i];
		if (a >= 0 && a < n && b >= 0 && b < m && g[a][b] == '#')
		{
			dfs (a, b);
		}
	}
}

int main()
{
	cin >> n >> m;
	
	for (int i=0; i < n; i ++)
		scanf("%s", &g[i]);
	int cnt=0;
	for (int i=0; i < n; i++)
	{
		for (int j=0; j < m; j ++)
		{
			if (g[i][j] == '#')
			{
				dfs (i, j);
				cout << i << " " << j << endl;
				cnt ++;
			}
		}
	}
	if (!cnt)
	printf("There are %d ships.", cnt);	
	else puts("Bad placement.");
	return 0;
}