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

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    ll N; cin >> N;
    vi A(N); 
    ll subtask; cin >> subtask;
    rep(i,0,N) cin >> A[i];

    vi t, l, r;

    auto count = [&](vi a){
        while(*min_element(all(a)) < 0){
            vi sum(N+1);
            rep(i,0,N) sum[i+1] = sum[i]+a[i];
            REP(i,0,N){
                if(sum[i] < 0){
                    t.pb(2);
                    l.pb(1);
                    r.pb(i-1);
                    rep(j,1,i-1){
                        a[j] += a[j-1];
                        a[j] = std::min(a[j], inf);
                    }
                }
            }
        }
        
    };

    rep(i,0,N){
        if(A[i]){
            if(A[i] < 0){
                t.pb(1);
                l.pb(0);
                r.pb(0);
                rep(j,0,N) A[j] *= -1;
            }
            break;
        }
    }

    count(A);

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