#include <bits/stdc++.h>
using namespace std;

struct node {
	int x, y;
};
int len = 0;
node a[10005];

int main() {
	int n, m;
	char c;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			cin >> c;
			if (c == '#') {
				a[++len].x = i;
				a[len].y = j;
			}
		}
	int ans = 0;
	for (int i = 1; i <= len; i++)
		for (int j = 1; j <= len; j++) {
			if (i == j)
				continue;
			if ((abs(a[i].x - a[j].x) + abs(a[i].y - a[j].y)) <= 2) {
				cout << a[i].x << '-' << a[i].y << ' ' << a[j].x << '-' << a[j].y << '\n';
				ans++;
			}
		}
	cout << ans;
}