#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define ULL unsigned LL
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
using namespace std;
LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
namespace qiqi {
	const int N = 2005; int n,m; char s[N]; vector<pair<pii,int>> ans; bitset<N> f[N][2];
	void main() {
		m = read(); n = read();
		rep(i,1,m) {
			scanf("%s",s+1);
			rep(j,1,n) f[j][s[j]-'0'][i] = 1;
		}
		rep(i,1,n) {
			rep(j,1,i-1) {
				if ((f[j][0]&f[i][0]).none()) ans.eb(mp(mp(j,i),4));
				if ((f[j][0]&f[i][1]).none()) ans.eb(mp(mp(j,i),2));
				if ((f[j][1]&f[i][0]).none()) ans.eb(mp(mp(j,i),3));
				if ((f[j][1]&f[i][1]).none()) ans.eb(mp(mp(j,i),1));
			}
			if (f[i][0].none()) ans.eb(mp(mp(i,i),4));
			if (f[i][1].none()) ans.eb(mp(mp(i,i),1));
		}
		printf("%d\n",(int)ans.size());
		for (auto [p,c]:ans) {
			printf("%d %d %d\n",p.fi-1,p.se-1,c);
		}
	}
}
int main() {
	qiqi::main(); return 0;
}