#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back
#define eb emplace_back
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;

template<class T> inline T& cmin(T& a, const T& b) { if(b < a) a = b; return a; }
template<class T> inline T& cmax(T& a, const T& b) { if(a < b) a = b; return a; }
template<class... Args> void print(Args&&... args) {
    ((cout << args << ' '), ...);
}
template<class... Args> void println(Args&&... args) {
    print(args...), cout << endl;
}

const int N = 2e5 + 8;

int n, g, a[N];

void nontrivial(bool rev) {
    int suf[N] = {};
    per(i, n, 1) suf[i] = min(suf[i + 1] + a[i], 0);
    ll sum1 = 0, sum2 = 0;
    rep(i, 1, n) {
        sum1 += a[i];
        sum2 += sum1;
        if(sum2 < 0) break;
        if(sum2 + suf[i + 1] >= 0) {
            println(2);
            !rev ? println(2, 1, i) : println(3, n - i + 1, n);
            println(!rev ? 2 : 3, 1, n);
            exit(0);
        }
    }
    if(n > 3000) return;
    int pre[N] = {};
    bool ban[N] = {};
    rep(i, 1, n) {
        pre[i] = pre[i - 1] + a[i];
        ban[i] = ban[i - 1] | pre[i] < 0;
    }
    rep(r, 1, n) {
        ll sum1 = 0, sum2 = 0, mn = 0;
        per(l, r, 1) {
            sum1 += a[l];
            sum2 += sum1;
            mn = min(0LL, mn + sum1);
            if(!ban[l - 1] && pre[l - 1] + mn >= 0 && pre[l - 1] + sum2 + suf[r + 1] >= 0) {
                println(2);
                !rev ? println(3, l, r) : println(2, n - r + 1, n - l + 1);
                println(!rev ? 2 : 3, 1, n);
                exit(0);
            }
        }
    }
}
void solve0() {
    bool ok = 1;
    rep(i, 1, n) ok &= a[i] >= 0;
    if(ok) println(0), exit(0);
}
void solve1() {
    bool ok = 1;
    rep(i, 1, n) ok &= a[i] <= 0;
    if(ok) {
        println(1);
        println(1);
        exit(0);
    }
    int sum = 0;
    ok = 1;
    rep(i, 1, n) sum += a[i], ok &= sum >= 0;
    if(ok) {
        println(1);
        println(2, 1, n);
        exit(0);
    }
    sum = 0;
    ok = 1;
    per(i, n, 1) sum += a[i], ok &= sum >= 0;
    if(ok) {
        println(1);
        println(3, 1, n);
        exit(0);
    }
}
void solve2() {
    int sum = 0;
    bool ok = 1;
    rep(i, 1, n) sum += a[i], ok &= sum <= 0;
    if(ok) {
        println(2);
        println(1);
        println(2, 1, n);
        exit(0);
    }
    sum = 0;
    ok = 1;
    per(i, n, 1) sum += a[i], ok &= sum <= 0;
    if(ok) {
        println(2);
        println(1);
        println(3, 1, n);
        exit(0);
    }
    rep(i, 0, 1) {
        nontrivial(i);
        reverse(a + 1, a + n + 1);
    }
}
void solve3() {
    int sum = 0, mx = 0, pos = 0;
    per(i, n, 1) {
        sum -= a[i];
        if(sum > mx) mx = sum, pos = i;
    }
    if((n - pos + 1) * 2 >= n) {
        println(3);
        println(1);
        println(2, pos, n);
        println(3, 1, n);
    } else {
        pos--;
        println(3);
        println(3, 1, pos);
        println(3, 1, pos);
        println(2, 1, n);
    }
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> g;
    rep(i, 1, n) cin >> a[i];
    solve0();
    solve1();
    solve2();
    solve3();
}