#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

    int n, g;
    cin >> n >> g;

    auto work = [&](vector<ll> &a, int l, int r, int op) -> vector<ll> {
        auto ia = a;
        if (op == 1) {
            for (auto &x : a) {
                x = -x;
            }
        } else if (op == 2) {
            for (int i = l + 1; i < r; ++i) {
                a[i] += a[i - 1];
                a[i] = min<ll>(a[i], 1e18);
            }
        } else {
            for (int i = r - 2; i >= l; --i) {
                a[i] += a[i + 1];
                a[i] = min<ll>(a[i], 1e18);
            }
        }
        swap(ia, a);
        return ia;
    };

    auto good = [&](const vector<ll> &a) {
        return *min_element(a.begin(), a.end()) >= 0;
    };

    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    if (good(a)) {
        cout << "0\n";
        return 0;
    }
    for (int t = 1; t <= 3; ++t) {
        auto ia = work(a, 0, n, t);
        if (good(ia)) {
            cout << "1\n";
            cout << t << " ";
            if (t > 1) {
                cout << "1 " << n;
            }
            cout << '\n';
            return 0;
        }
    }
    if (n <= 3000) {
        for (int i = 1; i <= n; ++i) {
            auto ia = work(a, 0, i, 2);
            ia = work(ia, 0, n, 2);
            if (good(ia)) {
                cout << "2\n";
                cout << "2 1 " << i << '\n' << "2 1 " << n << '\n';
                return 0;
            }
        }
    }
    pair<ll, int> minSum{0, -1}, maxSum{0, -1};
    ll pref = 0;
    ll maxseg = 0;
    int lmax = -1, rmax = -1;
    for (int i = 0; i < n; ++i) {
        pref += a[i];
        if (abs(pref - minSum.first) > abs(maxseg)) {
            maxseg = pref - minSum.first;
            lmax = minSum.second + 1;
            rmax = i + 1;
        }
        if (abs(pref - maxSum.first) > abs(maxseg)) {
            maxseg = pref - maxSum.first;
            lmax = maxSum.second + 1;
            rmax = i + 1;
        }
        if (minSum.first > pref) {
            minSum = pair(pref, i);
        }
        if (maxSum.first < pref) {
            maxSum = pair(pref, i);
        }
    }
    vector<vector<int>> ans;
    if (maxseg < 0) {
        a = work(a, 0, n, 1);
        ans.push_back({1});
        maxseg = -maxseg;
    }
    a = work(a, lmax, n, 2);
    a = work(a, 0, rmax, 3);
    ans.push_back({2, lmax + 1, n});
    ans.push_back({3, 1, rmax});
    cout << ans.size() << '\n';
    for (auto f : ans) {
        for (auto u : f) {
            cout << u << " ";
        }
        cout << '\n';
    }
    assert(good(a));


    return 0;
}