#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x.size())
#define out(x) cerr << #x << " = " << x << " "
#define outln(x) cerr << #x << " = " << x << endl
const int N = 2005;
int n, m;
char s[N];
int a[N][N];
vector<tuple<int, int, int, int> > ans;

void work(int sx, int sy) {
	int px = sx + 1, py = sy + 1;
	for (; px <= n; ++px) {
		if (a[px][sy + 1]) {
			if (a[px][sy + 2] && a[px + 1][sy] && a[px + 1][sy + 1] && !a[px + 1][sy + 2] && a[px + 2][sy] && a[px + 2][sy + 1]) {
				work(px, sy + 1);
			} else {
				break;
			}
		}
	}
	for (; py <= m; ++py) {
		if (a[sx + 1][py]) {
			if (a[sx + 2][py] && a[sx][py + 1] && a[sx + 1][py + 1] && !a[sx + 2][py + 1] && a[sx][py + 2] && a[sx + 1][py + 2]) {
				work(sx + 1, py);
			} else {
				break;
			}
		}
	}
	ans.emplace_back(sx, sy, px, py);
	for (int i = sx; i <= px; ++i) a[i][sy] = 0;
	for (int i = sy; i <= py; ++i) a[sx][i] = 0;
	for (int i = sx; i <= px; ++i) a[i][py] = 0;
	for (int i = sy; i <= py; ++i) a[px][i] = 0;
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%s", s + 1);
		for (int j = 1; j <= m; ++j) {
			a[i][j] = s[j] == 'X';
		}
	}
	for (int i = 1; i < n; ++i) {
		for (int j = 1; j < m; ++j) {
			if (a[i][j] && a[i][j + 1] && a[i + 1][j] && !a[i + 1][j + 1]) {
				work(i, j);
			}
		}
	}
	printf("%d\n", sz(ans));
	for (auto [p1, p2, p3, p4] : ans) {
		printf("%d %d %d %d\n", p1, p2, p3, p4);
	}
	return 0;
}