#include <bits/stdc++.h>

int main(){
    using namespace std;
    unsigned long N, M;
    cin >> N >> M;
    string X;
    cin >> X;
    X.push_back('1');
    vector<unsigned long> dif;
    for(unsigned long i{}; i < M; ++i)if(X[i] != X[i + 1])dif.emplace_back(M - i - 1);
    vector<tuple<unsigned long, unsigned long, unsigned long, unsigned long>> ops;
    vector<bitset<100>> state(M + 1);

    ops.emplace_back(2, 0, 0, 0);
    if(!empty(dif)){
        for(unsigned long i{}; i < dif[0]; ++i)ops.emplace_back(1, i + 1, i, 0);
        for(const auto& i : dif)ops.emplace_back(2, 0, 0, i);
    }

    cout << size(ops) << endl;
    for(const auto& [t, x, y, z] : ops)if(t == 1)cout << t << " " << x << " " << y << '\n';
    else cout << t << " " << x << " " << y << " " << z << '\n';
    return 0;
}