#include"bits/stdc++.h"

using lint = int64_t;

constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x63636363;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x6363636363636363;

using namespace std;

struct scc_t {
    int n, t, scc_num;
    vector<vector<int>> adj;
    vector<int> low, id, stk, in_stk, cc_id;
    scc_t(const vector<vector<int>>& g) : n(int(g.size())), t(0), scc_num(0),
    adj(g), low(n,-1), id(n,-1), in_stk(n, false), cc_id(n) {}
    template<class F> void dfs(int cur, F f) {
        id[cur] = low[cur] = t++;
        stk.push_back(cur);
        in_stk[cur] = true;
        for (int nxt : adj[cur]) {
            if (id[nxt] == -1) {
                dfs(nxt, f);
                low[cur] = min(low[cur], low[nxt]);
            } else if (in_stk[nxt])
                low[cur] = min(low[cur], id[nxt]);
        }
        if (low[cur] == id[cur]) {
            vector<int> cc; cc.reserve(stk.size());
            while (true) {
                int v = stk.back(); stk.pop_back();
                in_stk[v] = false;
                cc.push_back(v);
                cc_id[v] = scc_num;
                if (v == cur) break;
            } f(cc); scc_num ++;
        }
    }
    template<class F> void solve(F f) {
        stk.reserve(n);
        for (int r = 0; r < n; ++r)
            if (id[r] == -1) dfs(r, f);
    }
};


const int M = 4002;
using B = bitset<M>;
B mat[M], matRev[M], adj[M], alcanca[M];
int always[M];


struct TwoSat {
    int N;
    vector<vector<int>> gr;
    vector<int> values; // 0 = false, 1 = true
    TwoSat(int n = 0) : N(n), gr(2*n) {}
    int add_var() { // (optional)
        gr.emplace_back();
        gr.emplace_back();
        return N++;
    }
    void either(int f, int j) {
        f = max(2*f, -1-2*f);
        j = max(2*j, -1-2*j);
        gr[f].push_back(j^1);
        gr[j].push_back(f^1);
    }
    void implies(int f, int j) { either(~f, j); }
    void set_value(int x) { either(x, x); }
    void at_most_one(const vector<int>& li) { // (optional)
        if (int(li.size()) <= 1) return;
        int cur = ~li[0];
        for (int i = 2; i < int(li.size()); ++i) {
            int next = add_var();
            either(cur, ~li[i]);
            either(cur, next);
            either(~li[i], next);
            cur = ~next;
        }
        either(cur, ~li[1]);
    }
    int solve() {
        scc_t s(gr);
        vector<int> ordem; ordem.reserve(2*N);
        s.solve([&ordem](const vector<int> &v){ 
            ordem.insert(ordem.end(), v.begin(), v.end());
        } );
        values.assign(N, -1);
        for (int i = 0; i < N; ++i) if (s.cc_id[2*i] == s.cc_id[2*i+1]) return 0;
        for (int i = 0; i < N; ++i){
            if (s.cc_id[2*i] < s.cc_id[2*i+1]) values[i] = false;
            else values[i] = true;
        }
        reverse(ordem.begin(), ordem.end());
        for(int o =0; o<2*N; o++){
            int u = ordem[o];
            for(int v : gr[u]){
                adj[u][v] = true;
                alcanca[u][v] = true;
            }
        }
        for(int o = 2*N-1; o >= 0; o--){
            int u = ordem[o];
            for(int v : gr[u])
                alcanca[u] |= alcanca[v];
            alcanca[u][u] = false;
        }
        vector<vector<int>> adjAlc(2*N);
        for(int u = 0; u < 2*N; u++){
            for(int v=0; v<2*N; v++){
                if(alcanca[u][v])
                    adjAlc[u].push_back(v);
            }   
        }
        B settado;
        vector<bool> valor(2*N);
        for(int u =0; u<2*N; u++){
            int x = 2*u, notx = 2*u+1;
            if(alcanca[x][notx]){
                settado[x] = settado[notx] = true;
                valor[x] = false;
                valor[notx] = true;
                for(int v = 0; v < 2*N; v++)
                    if(alcanca[notx][v]){
                        settado[v] = settado[v^1] = true;
                        valor[v] = true;
                        valor[v^1] = false;
                    }
            } else if(alcanca[notx][x]){
                settado[x] = settado[notx] = true;
                valor[x] = true;
                valor[notx] = false;
                for(int v = 0; v < 2*N; v++)
                    if(alcanca[x][v]){
                        settado[v] = settado[v^1] = true;
                        valor[v] = true;
                        valor[v^1] = false;
                    }
            }
        }
        int ans = 0;
        auto count_sol = [&](int o, auto &&self) -> void {
            if(o == 2*N){
                ans++;
                // cout<<"SOL \n";
                // for(int u=0; u<N; u++){
                //     cout<<u<<" "<<valor[2*u]<<" "<<valor[2*u+1]<<"\n";
                // }
                return;
            }
            int u = ordem[o];
            if(settado[u]){
                self(o+1, self);
            } else {
                vector<int> alc;
                bool ok = true;
                if(ok)
                    for(int v : adjAlc[u]){
                        if(settado[v] && valor[v] == false){
                            ok = false;
                            break;
                        }
                        if(!settado[v]){
                            settado[v] = settado[v^1] = true;
                            valor[v] = true;
                            valor[v^1] = false;
                            alc.push_back(v);
                        }
                    }
                settado[u] = settado[u^1] = true;                
                if(ok){
                    valor[u] = true;
                    valor[u^1] = false;
                    self(o+1, self);
                } 
                
                for(int v : alc){
                    settado[v] = settado[v^1] = false;
                }
                valor[u] = false;
                valor[u^1] = true;
                self(o+1, self);
                settado[u] = settado[u^1] = false;            
            }
        };
        count_sol(0, count_sol);
        return ans;
    }
};

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    cin>>n>>m;
    for(int j=0; j<m; j++){
        always[j] = -1;
    }
    for(int i =0; i<n; i++){
        string s; cin>>s;
        for(int j=0; j<m; j++){
            mat[j][i] = int(s[j] - '0');
            matRev[j][i] = !mat[j][i];
        }
    }
    TwoSat sat(m);
    vector<tuple<int, int, int>> op;
    op.reserve(2*m);

    for(int u =0; u<m; u++){
        if(int c = mat[u].count(); c == n){
            sat.either(u, u);
            op.emplace_back(u, u, 4);
            always[u] = 1;
        } else if(c == 0){
            sat.either(~u, ~u);
            op.emplace_back(u, u, 1);
            always[u] = 0;
        }
    }
    for(int u =0; u<m; u++){
        for(int v=u+1; v<m; v++){
            if((~always[u]) && (~always[v])) continue;
            vector<vector<int>> ok(2, vector<int>(2));
            
            int cnt = 0;

            if(( matRev[u] & matRev[v]).count() ){
                ok[0][0] = true;
                cnt++;
            }
            if(( matRev[u] & mat[v]).count() ){
                ok[0][1] = true;
                cnt++;
            }
            if(( mat[u] & matRev[v]).count() ){
                ok[1][0] = true;
                cnt++;
            }
            if(( mat[u] & mat[v]).count() ){
                ok[1][1] = true;
                cnt++;
            }
            
            if(cnt == 4) continue;
            
            if(!ok[0][0]){
                sat.implies(~u, v);
                sat.implies(~v, u);
                op.emplace_back(u, v, 4);
            }
            if(!ok[0][1]){ 
                sat.implies(~u, ~v);
                sat.implies(v, u);
                op.emplace_back(u, v, 2);
            }
            if(!ok[1][0]){
                sat.implies(u, v);
                sat.implies(~v, ~u);
                op.emplace_back(u, v, 3);
            }
            if(!ok[1][1]){
                sat.implies(u, ~v);
                sat.implies(v, ~u);
                op.emplace_back(u, v, 1);
            }           
            // cout<<"u "<<u<<" v "<<v<<"\n";
            // for(int i=0;i<2; i++){ 
            //     for(int j=0;j<2; j++){
            //         if(ok[i][j])
            //             cout<<" "<<i<<" "<<j<<"\n"; 
            //     } 
            // }
        }
    }
    if(int count_sol = sat.solve(); count_sol == n){
        cout<<op.size()<<'\n';
        for(const auto &[u,v,t] : op)
            cout<<u<<' '<<v<<' '<<t<<'\n';
    } else {
        cout<<"-1\n";
    }
    return 0;
}