#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
//#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
pair <int, int> Hor[N], Ver[N];
vector <int> g[N];
map <pair <int, int>, int> Ver_Id, Hor_Id;
int Hor_Kol, Ver_Kol, i, j, n, m, ans, mV[N], mH[N];
bool mk[N], mkV[N], mkH[N];
char c[505][505];
int kuhn(int v)
{
if (mk[v]) return 0;
mk[v] = 1;
for (auto u : g[v])
{
if (mH[u] == -1 || kuhn(mH[u]))
{
mH[u] = v;
return 1;
}
}
return 0;
}
void dfs(int v)
{
mkV[v] = 1;
for (auto u : g[v])
{
if (mkH[u]) continue;
mkH[u] = 1;
dfs(mH[u]);
}
}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
cin >> c[i][j];
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
{
if (c[i][j] == '0') continue;
if (i + 1 <= n && c[i + 1][j] == '0')
{
Ver_Id[{i, j}] = Ver_Kol;
Ver[Ver_Kol++] = {i, j};
}
if (j + 1 <= m && c[i][j + 1] == '0')
{
Hor_Id[{i, j}] = Hor_Kol;
Hor[Hor_Kol++] = {i, j};
}
}
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
{
if (c[i][j] == '1') continue;
int I = i, J = j;
while (I >= 0 && c[I][j] == '0') I--;
while (J >= 0 && c[i][J] == '0') J--;
g[Ver_Id[{I, j}]].pb(Hor_Id[{i, J}]);
}
for (i = 0; i < Hor_Kol; i++) mH[i] = -1, mkH[i] = 0;
for (i = 0; i < Ver_Kol; i++) mV[i] = -1, mkV[i] = 0;
ans = 0;
for (i = 0; i < Ver_Kol; i++)
{
for (j = 0; j < Ver_Kol; j++) mk[j] = 0;
ans += kuhn(i);
}
cout << ans << el;
for (i = 0; i < Hor_Kol; i++)
if (mH[i] != -1)
mV[mH[i]] = i;
for (i = 0; i < Ver_Kol; i++)
{
if (mV[i] != -1) continue;
dfs(i);
}
for (i = 0; i < Ver_Kol; i++)
if (!mkV[i])
cout << Ver[i].F << " " << Ver[i].S << " DOLJE" << el;
for (i = 0; i < Hor_Kol; i++)
if (mkH[i])
cout << Hor[i].F << " " << Hor[i].S << " DESNO" << el;
}
// x ^ 2 + y ^ 2 = 1
// x * a_i + y * b_i
// a_i = -b_i * tan(alpha)
// a_i / -b_i = tan(alpha)
// alpha = atan(a_i / (-b_i))
