#include <iostream>
#include <algorithm>
#include <cstdlib>

using namespace std;

typedef long long ll;

typedef struct Item_tag {
	int pos;
	ll req;
	Item_tag(){}
	Item_tag(int pos_, ll req_){
		pos = pos_;
		req = req_;
	}
} Item;

typedef struct Segment_tag {
	int k;
	ll b;
	
	Segment_tag(){}
	
	Segment_tag(int k_, ll b_){
		k = k_;
		b = b_;
	}
	
	inline ll calc(int x){
		return (ll)k * x + b;
	}
} Segment;

typedef struct {
	int ls;
	int rs;
	Segment seg;
} Node;

int top, root, id;
int a[200007], sum[200007], min_val[200007], max_val[200007], stk[100007], p[200007];
ll sum_[200007], val[200007];
Item item[100007];
Node tree[800007];

bool operator <(const Item a, const Item b){
	return a.req > b.req;
}

inline void check0(int n){
	for (register int i = 1; i <= n; i++){
		if (a[i] < 0) return;
	}
	cout << 0 << endl;
	exit(0);
}

inline void check1_flip(int n){
	for (register int i = 1; i <= n; i++){
		if (a[i] > 0) return;
	}
	cout << 1 << endl;
	cout << 1 << endl;
	exit(0);
}

inline void check1_pre(int n){
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] + a[i];
		if (sum[i] < 0) return;
	}
	cout << 1 << endl;
	cout << "2 1 " << n << endl;
	exit(0);
}

inline void check1_suf(int n){
	for (register int i = n; i >= 1; i--){
		sum[i] = sum[i + 1] + a[i];
		if (sum[i] < 0) return;
	}
	cout << 1 << endl;
	cout << "3 1 " << n << endl;
	exit(0);
}

inline void check2_flip_pre(int n){
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] - a[i];
		if (sum[i] < 0) return;
	}
	cout << 2 << endl;
	cout << 1 << endl;
	cout << "2 1 " << n << endl;
	exit(0);
}

inline void check2_flip_suf(int n){
	for (register int i = n; i >= 1; i--){
		sum[i] = sum[i + 1] - a[i];
		if (sum[i] < 0) return;
	}
	cout << 2 << endl;
	cout << 1 << endl;
	cout << "3 1 " << n << endl;
	exit(0);
}

inline void check2_pre_pre(int n){
	int pos = n, r = 0;
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] + a[i];
		sum_[i] = sum_[i - 1] + sum[i];
	}
	for (register int i = 1; i <= n; i++){
		if (sum_[i] < 0){
			pos = i - 1;
			break;
		}
	}
	min_val[n + 1] = 1e9;
	for (register int i = n; i >= 1; i--){
		min_val[i] = min(min_val[i + 1], sum[i]);
	}
	for (register int i = 1; i <= pos; i++){
		if (sum_[i - 1] + min_val[i + 1] >= 0){
			r = i;
			break;
		}
	}
	if (r == 0) return;
	cout << 2 << endl;
	cout << "2 1 " << r << endl;
	cout << "2 1 " << n << endl;
	exit(0);
}

inline void check2_suf_suf(int n){
	int pos = 1, l = 0;
	for (register int i = n; i >= 1; i--){
		sum[i] = sum[i + 1] + a[i];
		sum_[i] = sum_[i + 1] + sum[i];
	}
	for (register int i = n; i >= 1; i--){
		if (sum_[i] < 0){
			pos = i + 1;
			break;
		}
	}
	min_val[0] = 1e9;
	for (register int i = 1; i <= n; i++){
		min_val[i] = min(min_val[i - 1], sum[i]);
	}
	for (register int i = pos; i <= n; i++){
		if (sum_[i + 1] + min_val[i - 1] >= 0){
			l = i;
			break;
		}
	}
	if (l == 0) return;
	cout << 2 << endl;
	cout << "3 " << l << " " << n << endl;
	cout << "3 1 " << n << endl;
	exit(0);
}

inline void check2_minmax(int n){
	int min_pos = 0, max_pos = 0;
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] + a[i];
		if (min_pos == 0 || sum[min_pos] > sum[i]) min_pos = i;
		if (max_pos == 0 || sum[max_pos] < sum[i]) max_pos = i;
	}
	if (min_pos == n || min_pos > max_pos) return;
	cout << 2 << endl;
	cout << "2 " << min_pos + 1 << " " << n << endl;
	cout << "3 1 " << max_pos << endl;
	exit(0);
}

inline ll divide(ll x, int y){
	if (x >= 0) return x / y;
	return -((-x - 1) / y + 1);
}

inline ll query(int x, ll y){
	int l = 2, r = top;
	ll ans = divide(y - sum_[stk[1]], x - stk[1]);
	while (l <= r){
		int mid = (l + r) >> 1;
		if ((y - sum_[stk[mid]]) * (x - stk[mid - 1]) < (ll)(y - sum_[stk[mid - 1]]) * (x - stk[mid])){
			l = mid + 1;
			ans = divide(y - sum_[stk[mid]], x - stk[mid]);
		} else {
			r = mid - 1;
		}
	}
	return ans;
}

bool cmp(const int a, const int b){
	return sum[a - 1] > sum[b - 1];
}

void insert(int &x, int l, int r, Segment seg){
	int mid = (l + r) >> 1;
	if (x == 0){
		x = ++id;
		tree[x].ls = tree[x].rs = 0;
		tree[x].seg.k = 0x7fffffff;
	}
	if (tree[x].seg.k == 0x7fffffff || tree[x].seg.calc(mid) < seg.calc(mid)) swap(tree[x].seg, seg);
	if (l == r || seg.k == 0x7fffffff) return;
	if (tree[x].seg.calc(l) < seg.calc(l)) insert(tree[x].ls, l, mid, seg);
	if (tree[x].seg.calc(r) < seg.calc(r)) insert(tree[x].rs, mid + 1, r, seg);
}

ll get_max(int x, int l, int r, int k){
	if (x == 0) return 0x8000000000000000ll;
	int mid = (l + r) >> 1;
	ll ans = tree[x].seg.calc(k);
	if (l < r){
		if (k <= mid){
			ans = max(ans, get_max(tree[x].ls, l, mid, k));
		} else {
			ans = max(ans, get_max(tree[x].rs, mid + 1, r, k));
		}
	}
	return ans;
}

bool divide(int l, int r, int n, int minr, int &ansl, int &ansr){
	if (l == r || minr > r) return false;
	int mid = (l + r) >> 1, cnt = 0;
	top = 0;
	for (register int i = mid + 1; i <= r; i++){
		while (top > 1 && (sum_[i - 1] - sum_[stk[top]]) * (stk[top] - stk[top - 1]) >= (sum_[stk[top]] - sum_[stk[top - 1]]) * ((i - 1) - stk[top])) top--;
		stk[++top] = i - 1;
		if (i >= minr) item[++cnt] = Item(i, query(i, sum_[i - 1] + sum[n]));
	}
	sort(item + 1, item + cnt + 1);
	for (register int i = l; i <= mid; i++){
		p[i] = i;
	}
	sort(p + l, p + mid + 1, cmp);
	root = id = 0;
	for (register int i = mid; i >= l; i--){
		insert(root, -n, n, Segment(-(i - 1), sum_[i - 1] - sum[n]));
		val[i] = get_max(root, -n, n, sum[i - 1]);
	}
	root = id = 0;
	for (register int i = l, j = 1; i <= mid; i++){
		ll down = max(val[p[i]], sum_[p[i] - 1] + max_val[p[i] - 1] - sum[n] - (ll)p[i] * sum[p[i] - 1]);
		while (j <= cnt && item[j].req >= sum[p[i] - 1]){
			insert(root, -n, n, Segment(-item[j].pos, sum_[item[j].pos - 1]));
			j++;
		}
		if (down <= get_max(root, -n, n, sum[p[i] - 1])){
			ansl = p[i];
			for (register int k = 1; k < j; k++){
				if (down <= sum_[item[k].pos - 1] - (ll)item[k].pos * sum[p[i] - 1]){
					ansr = item[k].pos;
					break;
				}
			}
			return true;
		}
	}
	return divide(l, mid, n, minr, ansl, ansr) || divide(mid + 1, r, n, minr, ansl, ansr);
}

inline bool solve(int n, int &ansl, int &ansr){
	int minr = n;
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] + a[i];
		sum_[i] = sum_[i - 1] + sum[i];
		max_val[i] = max(max_val[i - 1], sum[i]);
	}
	while (sum[n] - sum[minr - 1] >= 0) minr--;
	return divide(1, n, n, minr, ansl, ansr);
}

inline void check2_pre_suf(int n){
	int l, r;
	if (solve(n, l, r)){
		cout << 2 << endl;
		cout << "2 " << l << " " << r << endl;
		cout << "3 1 " << n << endl;
		exit(0);
	}
}

inline void check2_suf_pre(int n){
	int l, r;
	reverse(a + 1, a + n + 1);
	if (solve(n, l, r)){
		cout << 2 << endl;
		cout << "3 " << n - r + 1 << " " << n - l + 1 << endl;
		cout << "2 1 " << n << endl;
		exit(0);
	}
	reverse(a + 1, a + n + 1);
}

inline void check3_flip_minmax(int n){
	int min_pos = 0, max_pos = 0;
	for (register int i = 1; i <= n; i++){
		sum[i] = sum[i - 1] - a[i];
		if (min_pos == 0 || sum[min_pos] > sum[i]) min_pos = i;
		if (max_pos == 0 || sum[max_pos] < sum[i]) max_pos = i;
	}
	if (min_pos == n || min_pos > max_pos) return;
	cout << 3 << endl;
	cout << 1 << endl;
	cout << "2 " << min_pos + 1 << " " << n << endl;
	cout << "3 1 " << max_pos << endl;
	exit(0);
}

int main(){
	int n, g;
	cin >> n >> g;
	for (register int i = 1; i <= n; i++){
		cin >> a[i];
	}
	check0(n);
	check1_flip(n);
	check1_pre(n);
	check1_suf(n);
	check2_flip_pre(n);
	check2_flip_suf(n);
	check2_pre_pre(n);
	check2_suf_suf(n);
	check2_minmax(n);
	check2_pre_suf(n);
	check2_suf_pre(n);
	check3_flip_minmax(n);
	return 0;
}