#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define ln "\n"
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple
#define all(a) a.begin(),a.end()

constexpr ll inf = 1e18;

vi move_1(vi A){
    rep(i,0,A.size()) A[i] *= -1;
    return A;
}

vi move_2(vi A, ll l, ll r){
    rep(i,l,r){
        A[i+1] += A[i];
        A[i+1] = std::max(A[i+1], -inf);
        A[i+1] = std::min(A[i+1], inf);
    }
    return A;
}

vi move_3(vi A, ll l, ll r){
    per(i,r-1,l){
        A[i] += A[i+1];
        A[i] = std::max(A[i], -inf);
        A[i] = std::min(A[i], inf);
    }
    return A;
}

void solve_subtask1(ll N){
    vi A(N);
    rep(i,0,N) cin >> A[i];
    if(*min_element(all(move_1(A))) >= 0) cout << 1 << ln;
    else if(*min_element(all(move_2(A,1,N))) >= 0) cout << 2 << " " << 1 << " " << N << ln;
    else cout << 3 << " " << 1 << "  " << N << ln;
}

ll lower_bound(ll N, vi a, ll l){
    vi sum(N);
    sum[l] = a[l];
    rep(i,l+1,N) sum[i] = sum[i-1]+a[i];
    rep(i,l,N){
        if(sum[i] < 0){
            return i-1;
        }
    }
    return N-1;
}

void print(vi t, vi l, vi r){
    cout << t.size() << ln;
    rep(i,0,t.size()){
        if(t[i] == 1) cout << 1 << ln;
        else cout << t[i] << " " << l[i] << " " << r[i] << ln;
    }
}

void solve_subtask2(ll N){
    vi A(N);
    rep(i,0,N) cin >> A[i];
    vi t,l,r;
    rep(i,0,N){
        if(A[i]){
            if(A[i] < 0){
                A = move_1(A);
                t.pb(1);
                l.pb(0);
                r.pb(0);
            }
            while(*min_element(all(A)) < 0){
                ll right = lower_bound(N, A, i);
                A = move_2(A, i, right);
                t.pb(2);
                l.pb(i+1);
                r.pb(right+1);
            }
            print(t,l,r);
            return;
        }
    }
}

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    ll N; cin >> N;
    ll subtask; cin >> subtask;
    if(subtask == 1) solve_subtask1(N);
    else solve_subtask2(N);
}