#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fs first
#define sc second
const int mxn = 505;
vector<int> paths[mxn*mxn];
map<int,tuple<int,int,int>> mp;
vector<int> bipath[mxn*mxn*2];
int matchx[mxn*mxn*2],matchy[mxn*mxn*2];
vector<int> choose;
bitset<mxn*mxn*2> vis;
struct Edge{
int to,cap,flow;
Edge(){
to = cap = flow = 0;
}
Edge(int tt,int cc){
to = tt,cap = cc;
flow = 0;
}
};
Edge edges[mxn*mxn*4];
string arr[mxn];
pii adding[mxn][mxn];
int pp = 0;
int rcnt = 1,ccnt = 0;
int ans = 0;
int level[mxn*mxn],ptr[mxn*mxn];
bool bfs(){
fill(level,level+mxn*mxn,-1);
queue<int> q;
level[0] = 0;
q.push(0);
while(!q.empty()){
auto now = q.front();
q.pop();
for(auto id:paths[now]){
if(edges[id].cap-edges[id].flow == 0)continue;
int nxt = edges[id].to;
// cout<<now<<":"<<nxt<<endl;
if(level[nxt] != -1)continue;
q.push(nxt);
level[nxt] = level[now]+1;
}
}
return level[1] != -1;
}
int dfs(int now,int big){
if(now == 1)return big;
if(!big)return 0;
for(int &cid = ptr[now];cid<paths[now].size();cid++){
int id = paths[now][cid];
if(edges[id].cap-edges[id].flow<=0)continue;
int nxt = edges[id].to;
if(level[nxt] != level[now]+1)continue;
int tmp = dfs(nxt,min(big,edges[id].cap-edges[id].flow));
if(!tmp)continue;
edges[id].flow += tmp;
edges[id^1].flow -= tmp;
return tmp;
}
return 0;
}
void dfsans(int now){
vis[now] = true;
for(auto nxt:bipath[now]){
if(matchy[nxt]&&!vis[matchy[nxt]]){
vis[nxt] = true;
dfsans(matchy[nxt]);
}
}
return;
}
set<int> st;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
for(int i = 0;i<n;i++){
cin>>arr[i];
}
for(int i =0;i<n;i++){
char pre = '0';
for(int j = 0;j<m;j++){
if(arr[i][j] == '1'&&pre != '1'){
rcnt++;
mp[rcnt] = make_tuple(i+1,j+1,0);
}
else if(arr[i][j] == '1')mp[rcnt] = make_tuple(i+1,j+1,0);
pre =arr[i][j];
adding[i][j].fs = rcnt;
}
}
int ccnt = rcnt;
for(int i = 0;i<m;i++){
char pre = '0';
for(int j= 0;j<n;j++){
if(arr[j][i] == '1'&&pre != '1'){
ccnt++;
mp[ccnt] = make_tuple(j+1,i+1,1);
}
else if(arr[i][j] == '1')mp[ccnt] = make_tuple(j+1,i+1,1);
pre = arr[j][i];
adding[j][i].sc = ccnt;
}
}
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
if(arr[i][j] == '1')continue;
paths[adding[i][j].fs].push_back(pp);
paths[adding[i][j].sc].push_back(pp^1);
edges[pp] = Edge(adding[i][j].sc,1);
edges[pp^1] = Edge(adding[i][j].fs,0);
pp += 2;
}
}
for(int i = 2;i<=rcnt;i++){
paths[0].push_back(pp);
paths[i].push_back(pp^1);
edges[pp] = Edge(i,1);
edges[pp^1] = Edge(0,0);
pp += 2;
}
for(int i = rcnt+1;i<=ccnt;i++){
paths[i].push_back(pp);
paths[1].push_back(pp^1);
edges[pp] = Edge(1,1);
edges[pp^1] = Edge(i,0);
pp += 2;
}
while(bfs()){
fill(ptr,ptr+mxn*mxn,0);
int re = 0;
while(re = dfs(0,mxn*mxn*mxn)){
ans += re;
}
}
cout<<ans<<'\n';
for(int i = 2;i<=rcnt;i++){
for(auto &j:paths[i]){
int nxt = edges[j].to;
if(nxt == 0||nxt == 1)continue;
// cout<<i<<":"<<nxt<<endl;
bipath[i].push_back(nxt);
bipath[nxt].push_back(i);
if(edges[j].flow){
matchx[i] = nxt;
matchy[nxt] = i;
st.insert(i);
st.insert(nxt);
}
}
}
for(int i = 2;i<=rcnt;i++){
if(!matchx[i])dfsans(i);
}
for(int i = 2;i<=rcnt;i++){
if(!vis[i])choose.push_back(i);
}
for(int i = rcnt+1;i<=ccnt;i++){
if(vis[i])choose.push_back(i);
}
assert(choose.size() == ans);
for(auto &i:choose){
cout<<get<0>(mp[i])<<' '<<get<1>(mp[i])<<' '<<(get<2>(mp[i]) == 0?"DESNO\n":"DOLJE\n");
}
return 0;
}
