#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,M;
string X;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	cin>>X;
	
	vector<vector<int>> ret;
	ret.push_back({2,100,100,100});
	// 100=2^M-1
	ret.push_back({1,101,100});
	// 101=2^M-2
	
	// 200=1
	ret.push_back({2,200,100,101});
	for(i=1;i<M;i++) {
		// 200+i=2^i
		ret.push_back({2,200+i,200+i-1,200+i-1});
	}
	reverse(ALL(X));
	ret.push_back({1,0,199});
	FOR(i,M) {
		if(X[i]=='1') {
			ret.push_back({2,0,0,0});
			ret.push_back({2,200+i,200+i,200+i});
			ret.push_back({2,0,0,200+i,200+i});
		}
	}
	cout<<ret.size()<<endl;
	FORR(r,ret) {
		FOR(i,r.size()) {
			if(i) cout<<" ";
			cout<<r[i];
		}
		cout<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}