#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
return out << a.first << ' ' << a.second; }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());)out<< ", " <<a[i];return out<<']';}
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl N = 5e2 + 3;
ll n, m, X, ans, lft [N][N], mark [N * N * 2], ptr = 2, match [N * N * 2];
char a [N][N];
vector <ll> adj [N * N * 2], lewd;
inline ll conv (cl &x, cl &y) { return (x - 1) * m + y; }
void DFS (cl &v, cl &h = 0) {
mark[v] = 1;
if (h) lewd.push_back(v);
for (auto &u : adj[v]) if (!mark[u]) DFS(u, 1 - h);
}
bool dfs (ll v) {
mark[v] = ptr;
for (auto u : adj[v]) if (match[u] == -1 || (mark[match[u]] != ptr && dfs(match[u]))) {
match[v] = u, match[u] = v;
return true;
}
return false;
}
void Find_Matching () {
memset(match, -1, sizeof match);
memset(mark, -1, sizeof mark);
bool can_find = true; ptr = -1;
while (can_find) {
can_find = false, ptr++;
for (ll v = ptr; v < SZ(lewd); v++) if (mark[lewd[v]] != ptr && match[lewd[v]] == -1) can_find |= dfs(lewd[v]);
}
}
void force (cl &v, cl &tp) {
mark[v] = tp;
if (tp == 1) {
if (!mark[match[v]]) force(match[v], 2);
}
else for (auto &u : adj[v]) if (!mark[u]) force(u, 1);
}
inline pll decompose (ll v) {
if (v > X) v -= X;
ll x, y = v % m ? v % m : m;
x = (v - y) / m + 1;
return pll(x, y);
}
int main ()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>> n >> m; X = n * m;
for (ll i = 1; i <= n; i++) for (ll j = 1; j <= m; j++) cin>> a[i][j];
for (ll i = 1, cur = -1; i <= n; i++) for (ll j = 1; j <= m; j++) {
if (a[i][j] - '0') cur = conv(i, j);
else lft[i][j] = cur;
}
for (ll j = 1, cur = -1; j <= m; j++) for (ll i = 1; i <= n; i++) {
if (a[i][j] - '0') cur = conv(i, j) + X;
else adj[lft[i][j]].push_back(cur), adj[cur].push_back(lft[i][j]);
}
for (ll v = 1; v <= X + X; v++) if (!mark[v]) DFS(v);
Find_Matching();
memset(mark, 0, sizeof mark);
for (ll v = 1; v <= X + X; v++) {
if (match[v] < 1) force(v, 2);
else ans++;
}
cout<< ans / 2 << '\n';
for (ll v = 1; v <= X + X; v++) {
if (match[v] > 0 && !mark[v]) mark[v] = 1, mark[match[v]] = 2;
if (match[v] > 0 && mark[v] == 1) {
if (v > X) cout<< decompose(v) << " DOLJE\n";
else cout<< decompose(v) << " DESNO\n";
}
}
return 0;
}
/*
*/
