#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int N = 2010;
int n, m;
char mp[N][N];
int ru[N][N], rd[N][N];
// int sm[N][N];
inline int Ask(int x, int y, int u, int v) {
    // return sm[u][v] - sm[x - 1][v] - sm[u][y - 1] + sm[x - 1][y - 1];
    int ans = 0;
    for (int i = x; i <= u; ++i)
        for (int j = y; j <= v; ++j)
            ans += (mp[i][j] == 'X');
    return ans;
}
inline bool Check(int x, int y, int u, int v) {
    // return Ask(x, y, u, v) == (u - x + 1) * (v - y + 1);
    int l_len = 3, r_len = 3;
    for (int i = x; i <= u; ++i) {
        if (mp[i][y] != 'X') return 0;
        if (mp[i][y - 1] == 'X') ++l_len;
        else { 
            if (l_len >= 1 && l_len <= 2) return 0;
            l_len = 0;
        }
        if (mp[i][y + 1] == 'X') ++r_len;
        else { 
            if (r_len >= 1 && r_len <= 2) return 0;
            r_len = 0;
        }
    }
    return 1;
}
vector<vector<int>> ans;
inline void Push(int x, int y, int u, int v) {
    // printf("Push %d %d %d %d\n", x, y, u, v);
    ans.push_back({x, y, u, v});
    for (int i = x; i <= u; ++i) mp[i][y] = mp[i][v] = '.';
    for (int i = y; i <= v; ++i) mp[x][i] = mp[u][i] = '.';
    // for (int i = 1; i <= n; ++i) puts(mp[i] + 1);
}
inline bool IsCorner(int i, int j, int d) {
    int d2 = (d + 1) & 3;
    if (mp[i][j] != 'X') return 0;
    if (mp[i + dx[d]][j + dy[d]] != 'X') return 0;
    if (mp[i + dx[d2]][j + dy[d2]] != 'X') return 0;
    if (mp[i + dx[d] + dx[d2]][j + dy[d] + dy[d2]] != '.') return 0;
    return 1;
}
int main() {
    // n = 2000 / 3 * 3, m = n;
    // // cerr << n * m / 9 << endl;
    // for(int i = 1; i <= n; i += 1)
    //     for(int j = 1; j <= m; j += 1)
    //         mp[i][j] = (i % 3 == 2 && j % 3 == 2 ? '.' : 'X');
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%s", mp[i] + 1);
    }
    // for (int i = 1; i <= n; ++i)
    //     for (int j = 1; j <= m; ++j) {
    //         // sm[i][j] = sm[i - 1][j] + sm[i][j - 1] - sm[i - 1][j - 1];
    //         if (mp[i][j] == 'X') {
    //             bool flag = 1;
    //             // for (int d = 0; d < 4; ++d) if (IsCorner(i, j, d)) flag = 0;
    //             sm[i][j] += flag;
    //         }
    //     }
    for (int i = 1; i <= n; ++i) {
        ru[i][m + 1] = m + 1;
        rd[i][m + 1] = m + 1;
        for (int j = m; j; --j) {
            ru[i][j] = ru[i][j + 1];
            rd[i][j] = rd[i][j + 1];
            if (IsCorner(i, j, 2)) ru[i][j] = j;
            if (IsCorner(i, j, 3)) rd[i][j] = j;
        }
    }
    for (int j = 1; j <= m; ++j)
        for (int i = 1; i <= n; ++i) if (mp[i][j] == 'X') {
            for (int k = i + 2; k <= n; ++k) if (IsCorner(k, j, 0)) {
                if (Ask(k, j, k + 2, j + 1) == 6) continue;
                int ri = ru[i][j + 1], rk = rd[k][j + 1];
                while (1) {
                    if (ri < rk) ri = ru[i][ri + 1];
                    else if (rk < ri) rk = rd[k][rk + 1];
                    else {
                        if (Check(i, ri, k, rk)) break;
                        ri = ru[i][ri + 1];
                        rk = rd[k][rk + 1];
                    }
                }
                Push(i, j, k, ri);
                // p
                // return 0;
                break;
            }
        }
    printf("%d\n", (int)ans.size());
    for (auto v : ans) printf("%d %d %d %d\n", v[0], v[1], v[2], v[3]);
    return 0;
}

/*
10 10
..........
XXXXXXXXXX
X...XXXX.X
X...X..X.X
X...XXXX.X
X.XXX.XXXX
X.X.X.X.XX
X.X.X.XXXX
X.XXX....X
XXXXXXXXXX

10 10
..........
XXXXXXXXXX
X........X
XXXX.....X
XX.X.....X
XXXX..XXXX
X.....X.XX
X.....XXXX
X........X
XXXXXXXXXX

5 6
XXX...
X.X...
XXXXXX
...X.X
...XXX

*/