#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

void mul(int x,int i){
	cout<<"1 "<<x<<" "<<i<<"\n";
}

void nand(int x,int i,int j){
	cout<<"2 "<<x<<" "<<i<<" "<<j<<"\n";
}

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M;
	cin>>N>>M;
	string S;
	cin>>S;
	rep(i,N){
		string T;
		cin>>T;
	}
	int X=1e8;
	int Y=1;
	int Z=1000;
	vector<tuple<int,int,int>> ans;
	rep(i,M){
		if(S[i]=='1') continue;
		ans.push_back({Y,X+2*M-i,Y+Z});
		Y+=Z;
		for(int j=i;j<M;j++){
			if(S[i]=='0') S[i]='1';
			else S[i]='0';
		}
	}
	reverse(ans.begin(),ans.end());
	cout<<M*2+2+ans.size()<<"\n";
	nand(X,X+1,X+1);
	rep(i,M-1){
		mul(X+i+1,X+i);
	}
	rep(i,M+1){
		nand(X+i+M,X,X+i);
	}
	nand(Y,X-1,X-2);
	for(auto x:ans){
		int a,b,c;
		tie(a,b,c)=x;
		nand(a,b,c);
	}
}