#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 4007, M = 2007;
const double pi = acos(-1);
int n, m;
string s[N]; 
bitset < N > F[N][2], e[N], all;
bitset < N > odd;
int cont = 0;
inline void dfs(int x, bitset < N > cur) {
	if((((cur & odd) << 1) & cur).any()) 
		return ;
	if(x == m) {
		++cont;
		if(cont > n) {
			cout << "-1\n";
			exit(0);
		} 
		return ;
	}
	if(!cur[x * 2 + 1]) {
		dfs(x + 1, cur | e[x * 2]);
	} 
	if(!cur[x * 2]) {
		dfs(x + 1, cur | e[x * 2 + 1]);
	}
}
int fb[N][N][2][2];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, n) {
		cin >> s[i];
		L(j, 0, m - 1) {
			F[j][s[i][j] - '0'].set(i); 
		} 
	}
	L(i, 1, n)
		all.set(i);
	int cons = 0;
	L(x, 0, m - 1) {
		L(y, x, m - 1) {
			L(a, 0, 1) {
				L(b, 0, 1) {
					if((F[x][a] | F[y][b]) == all) {
						e[x * 2 + (a ^ 1)].set(y * 2 + b);
						e[y * 2 + (b ^ 1)].set(x * 2 + a);
						if(x == y && a != b) continue;
						++cons;
						fb[x][y][a][b] = 1;
					}
				}
			}
		}
	}
	L(k, 0, m * 2 - 1) 
		L(i, 0, m * 2 - 1) if(e[i][k]) 
			e[i] |= e[k];
	L(i, 0, m - 1) 
		odd.set(i * 2);
	dfs(0, bitset < N > ());
	cout << cons << '\n';
	L(x, 0, m - 1) {
		L(y, 0, m - 1) {
			L(a, 0, 1) {
				L(b, 0, 1) {
					if(x == y && a != b) continue;
					if(fb[x][y][a][b]) {
						cout << x << ' ' << y << ' ' << a + b * 2 + 1 << '\n'; 
					}
				}
			}
		}
	} 
	return 0;
}