#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define per(i, l, r) for (int i = (r - 1); i >= l; --i)
#define ALL(x) (x).begin(), (x).end()

using i64 = long long;

constexpr i64 cap = 1000000000000000000ll;

void main_() {
    int N, G;
    cin >> N >> G;
    vector<i64> A(N);
    for (auto &e : A) cin >> e;
    if (G == 1) {
        if (all_of(ALL(A), [](i64 v) { return v >= 0; })) {
            cout << 0 << endl;
        } else if (all_of(ALL(A), [](i64 v) { return v <= 0; })) {
            cout << 1 << '\n' << 1 << endl;
        } else {
            vector<i64> B(N), C(N);
            rep(i, 0, N) {
                B[i] = (i == 0 ? 0 : B[i - 1]) + A[i];
            }
            per(i, 0, N) {
                C[i] = (i == N - 1 ? 0 : C[i + 1]) + A[i];
            }
            if (all_of(ALL(B), [](i64 v) { return v >= 0; })) {
                cout << 1 << '\n' << 2 << ' ' << 1 << ' ' << N << endl;
            } else {
                cout << 1 << '\n' << 3 << ' ' << 1 << ' ' << N << endl;
            }
        }
        return;
    }
    if (G == 2) {
        i64 f = 0;
        for (const auto e : A) {
            if (e != 0) {
                f = e;
                break;
            }
        }
        if (f == 0) {
            cout << 0 << endl;
        } else {
            if (f == 1) {
                cout << 100 << endl;
                rep(i, 0, 100) cout << 2 << ' ' << 1 << ' ' << N << endl;
            } else {
                cout << 100 << endl;
                rep(i, 0, 99) cout << 2 << ' ' << 1 << ' ' << N << endl;
                cout << 1 << endl;
            }
        }
        return;
    }
    if (G == 5 or G == 6) {
        vector<pair<int, int>> ans;
        while (any_of(ALL(A), [](i64 x) { return x < 0; })) {
            __int128_t sum = 0;
            int r = N - 1;
            rep(i, 0, N) {
                sum += A[i];
                if (sum < A[i]) {
                    r = i - 1;
                    break;
                } else {
                    A[i] = sum;
                }
            }
            ans.push_back({0, r});
        }
        cout << ans.size() << endl;
        for (const auto &[a, b] : ans) cout << 2 << ' ' << a + 1 << ' ' << b + 1 << endl;
        return;
    }

    auto sol = [&]() -> vector<tuple<int, int, int>> {
        auto B = A;
        if (all_of(ALL(B), [](i64 v) { return v < 0; })) {
            vector<tuple<int, int, int>> res = {{-1, -1, -1}};
            return res;
        }
        vector<tuple<int, int, int>> ans;

        while (any_of(ALL(B), [](i64 v) { return v < 0; })) {
            int extendMax = 0;
            int la = -1, ra = -1;
            rep(l, 0, N) {
                __int128 sum = 0;
                int ex = 0;
                int lastR = N;
                rep(r, l, N) {
                    sum += B[r];
                    if (B[r] >= 0 and sum < 0) {
                        if (r != l) lastR = r - 1;
                        else lastR = r;
                        break;
                    }
                    if (B[r] < 0 and sum >= 0) {
                        ++ex;
                        if (ex > extendMax) {
                            extendMax = ex;
                            la = l;
                            ra = r;
                        }
                    }
                }
                l = lastR;
            }
            per(r, 0, N) {
                __int128 sum = 0;
                int ex = 0;
                int lastL = 0;
                per(l, 0, r + 1) {
                    sum += B[l];
                    if (B[l] >= 0 and sum < 0) {
                        if (l != r) lastL = l + 1;
                        else lastL = l;
                        break;
                    }
                    if (B[l] < 0 and sum >= 0) {
                        ++ex;
                        if (ex > extendMax) {
                            extendMax = ex;
                            la = r;
                            ra = l;
                        }
                    }
                }
                r = lastL;
            }

            ans.push_back({la < ra ? 2 : 3, min(la, ra), max(la, ra)});
            int i = la;
            __int128 sum = 0;
            while (true) {
                sum += B[i];
                __int128 v = sum;
                if (v >= cap) v = cap;
                if (v < -cap) v = -cap;
                B[i] = (i64)v;
                if (i == ra) break;
                i = la < ra ? (i + 1) : (i - 1);
            }
        }

        return ans;
    };

    const auto X = sol();
    for (auto &e : A) e = -e;
    auto Y = sol();
    Y.insert(Y.begin(), {1, 0, 0});
    vector<tuple<int, int, int>> ans;
    if (X.empty()) ans = X;
    else if (Y.size() == 1) ans = Y;
    else if (X[0] == make_tuple(-1, -1, -1)) ans = Y;
    else if (Y[1] == make_tuple(-1, -1, -1)) ans = X;
    else ans = X.size() < Y.size() ? X : Y;

    cout << ans.size() << endl;
    for (const auto &[t, l, r] : ans) {
        cout << t;
        if (t == 1) cout << endl;
        else cout << ' ' << l + 1 << ' ' << r + 1 << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    main_();
}