#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[M - i] != X[M - i - 1])dif.emplace_back(i);
    vector<tuple<unsigned long, unsigned long, unsigned long, unsigned long>> ops;

    ops.emplace_back(2, 0, 0, 0);
    if(!empty(dif)){
        for(unsigned long i{}; i < dif.back(); ++i)ops.emplace_back(1, i + 1 + N, i + N, 0);
        reverse(begin(dif), end(dif));
        for(const auto& i : dif)ops.emplace_back(2, 0, 0, i + N);
    }

    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;
}