#include<iostream>
#include<cstdio>
#include<bitset>
#include<queue>
#define N 2000
#define M 4000
#define K 8000000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int op,x,y;
};
reads tong[K+1];
int n,m,length,ans;
char c[N+1][N+1];
bool F[N+1][N+1][2][2];
bitset<N+1>B[M+1];
bitset<N+1>S1;
bitset<N+1>S2;
bitset<N+1>S3;
bitset<N+1>S4;
bitset<N+1>B1[M+1];
bitset<N+1>B2[M+1];
bitset<M+1>E[M+1];
bitset<M+1>used;
void bfs(int x)
{
    int top;
    queue<int>q;
    used[x]=0,q.push(x);
    while (!q.empty())
    {
	top=q.front(),q.pop();
	if (top<=m) B1[x][top]=1;
	else B2[x][top-m]=1;
	bitset<M+1>st=used&E[top];
	for (int i=st._Find_first();i!=st.size();i=st._Find_next(i)) used[i]=0,q.push(i);
    }
    return;
}
void dfs(int x,bitset<N+1>st1,bitset<N+1>st2)
{
    if (x==m+1)
    {
	ans++;
	return;
    }
    if (!((st1|B1[x])&(st2|B2[x])).count()) dfs(x+1,st1|B1[x],st2|B2[x]);
    if (ans>n) return;
    if (!((st1|B1[x+m])&(st2|B2[x+m])).count()) dfs(x+1,st1|B1[x+m],st2|B2[x+m]);
    if (ans>n) return;
    return;
}
int main()
{
    n=read(),m=read();
    for (int i=1;i<=n;++i)
	for (int j=1;j<=m;++j)
	{
	    cin>>c[i][j];
	    if (c[i][j]=='1') B[i][j]=1;
	}
    for (int i=1;i<=m;++i)
    {
	S1.reset(),S2.reset();
	for (int j=1;j<=n;++j)
	{
	    if (c[j][i]=='1') S1|=B[j];
	    else S2|=B[j];
	}
	for (int j=1;j<=i;++j)
	{
	    if (S1[j]) F[j][i][1][1]=1;
	    if (S2[j]) F[j][i][1][0]=1;
	}
	S1.set(),S2.set();
	for (int j=1;j<=n;++j)
	{
	    if (c[j][i]=='1') S1&=B[j];
	    else S2&=B[j];
	}
	for (int j=1;j<=i;++j)
	{
	    if (!S1[j]) F[j][i][0][1]=1;
	    if (!S2[j]) F[j][i][0][0]=1;
	}
    }
    for (int i=1;i<=m;++i)
	for (int j=i;j<=m;++j)
	{
	    if (!F[i][j][1][1]) E[i+m][j]=E[j+m][i]=1;
	    if (!F[i][j][0][1]) E[i][j]=E[j+m][i+m]=1;
	    if (!F[i][j][1][0]) E[i+m][j+m]=E[j][i]=1;
	    if (!F[i][j][0][0]) E[i][j+m]=E[j][i+m]=1;
	}
    for (int i=1;i<=(m<<1);++i) used.set(),bfs(i);
    dfs(1,S3,S4);
    if (ans>n)
    {
	puts("-1");
	return 0;
    }
    for (int i=1;i<=m;++i)
	for (int j=i;j<=m;++j)
	{
	    if (!F[i][j][1][1]) tong[++length]=(reads){1,i,j};
	    if (i<j&&!F[i][j][0][1]) tong[++length]=(reads){2,i,j};
	    if (i<j&&!F[i][j][1][0]) tong[++length]=(reads){3,i,j};
	    if (!F[i][j][0][0]) tong[++length]=(reads){4,i,j};
	}
    printf("%d\n",length);
    for (int i=1;i<=length;++i) printf("%d %d %d\n",tong[i].x-1,tong[i].y-1,tong[i].op);
    return 0;
}