#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2333;
bitset<N> bt[N], at[N];
int n, m;
string st;
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> st;
		for(int j = 0; j < m; j++){
			if(st[j] == '1') bt[j].set(i);
			else at[j].set(i);
		}
	}
	bitset<N> b[5];
	bool flag = 1;
	vector<array<int, 3>> ans;
	for(int i = 0; i < m; i++){
		if(bt[i].count() == n) ans.push_back({i, i, 4});
		else if(at[i].count() == n) ans.push_back({i, i, 1});
		for(int j = i + 1; j < m; j++){
			b[1] = at[i] | at[j];
			b[4] = bt[i] | bt[j];
			b[2] = bt[i] | at[j];
			b[3] = at[i] | bt[j];
			bool f = 0;
			for(int t = 1; t < 5; t++){
				if(b[t].count() == n){
					f = 1;
					ans.push_back({i, j, t});
				}
			}
			if(!f){
				flag = 0;
				break;
			}
		}
	}
	if(!flag) cout <<"-1\n";
	else {
		cout << ans.size() << '\n';
		for(auto[i, j, t] : ans){
			cout << i << " " << j << " " << t << '\n';
		}
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
}