#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 2e5 + 5;
const ll linf = 0x3f3f3f3f3f3f3f3f;

struct Line
{
	ll k,b; int id;
	ll get(ll x) const { return k * x + b;}
};

struct Segment_Tree
{
	Line tree[(MAXN*2)<<2];
	#define ls(u) ((u)<<1)
	#define rs(u) ((u)<<1|1)
	#define lson(u) ls(u),l,mid
	#define rson(u) rs(u),mid+1,r
	void build(int u,int l,int r)
	{
		tree[u] = {0, -linf, -1};
		if(l == r) return;
		int mid = l + ((r-l)>>1);
		build(lson(u)); build(rson(u));
	}
	void insert(int u,int l,int r,Line k)
	{
		int mid = l + ((r-l)>>1);
		if(tree[u].get(mid) < k.get(mid)) swap(tree[u], k);
		if(l == r) return;
		if(tree[u].get(l) < k.get(l)) insert(lson(u),k);
		if(tree[u].get(r) < k.get(r)) insert(rson(u),k);
	}
	pair<ll,int> query(int u,int l,int r,int q)
	{
		pair<ll,int> res = {tree[u].get(q), tree[u].id};
		if(l == r || res.second == -1) return res;
		int mid = l + ((r-l)>>1);
		return max(res, q <= mid? query(lson(u),q): query(rson(u),q));
	}
}tree1, tree2;

int check(int *a,int n)
{
	static ll sum1[MAXN], sum2[MAXN];
	for(int i=1; i<=n; ++i)
	{
		sum1[i] = sum1[i-1] + a[i];
		sum2[i] = sum2[i-1] + sum1[i];
	}
	
	static ll mn[MAXN];
	mn[n+1] = linf;
	for(int i=n; i>=0; --i)
		mn[i] = min(mn[i+1], sum1[i]);
	
	for(int i=0; i<=n; ++i)
	{
		if(sum2[i] < 0) break;
		if(mn[i+1] + sum2[i] - sum1[i] >= 0)
			return i;
	}
	return -1;
}

pii check2(int *a,int n)
{
	static ll sum[MAXN], suf[MAXN];
	for(int i=1; i<=n; ++i)
		sum[i] = sum[i-1] + a[i];
	
	suf[n+1] = linf;
	for(int i=n; i>=1; --i)
		suf[i] = min(suf[i+1], sum[i]);
	
	int liml = 0;
	while(liml < n && sum[liml] >= 0) ++liml;
	
	static ll f[MAXN];
	for(int i=1; i<=n; ++i)
		f[i] = f[i-1] + (-sum[i-1]);
	
	int vl = *min_element(sum, sum+n+1);
	int vr = *max_element(sum, sum+n+1);
	
	tree1.build(1,vl,vr);
	tree2.build(1,vl,vr);
	
	for(int i=1; i<=n; ++i)
	{
		if(i <= liml)
			tree1.insert(1,vl,vr, {-i+1, - f[i-1] + sum[i-1], i});
		tree2.insert(1,vl,vr, {-i+1, - f[i-1], i});
		
		auto t = tree1.query(1,vl,vr, sum[i]);
		ll mx = t.first + sum[i] * i + f[i];
		int pos = t.second;
		
		ll mx2 = max(0ll, tree2.query(1,vl,vr, sum[i]).first + sum[i] * i + f[i]);
		
		if(mx - mx2 >= 0 && mx + (suf[i+1] - sum[i]) >= 0)
		{
			return {pos, i};
		}
	}
	return {-1, -1};
}

int n,testid;
int a[MAXN];
int sum[MAXN];

int main(void)
{
	scanf("%d%d",&n,&testid);
	for(int i=1; i<=n; ++i)
		scanf("%d",&a[i]);
	
	if(*min_element(a+1, a+n+1) >= 0)
	{
		printf("0\n");
		return 0;
	}
	
	if(*max_element(a+1, a+n+1) <= 0)
	{
		printf("1\n");
		printf("1\n");
		return 0;
	}
	
	for(int i=1; i<=n; ++i)
		sum[i] = sum[i-1] + a[i];
	
	if(*min_element(sum, sum+n+1) >= 0)
	{
		printf("1\n");
		printf("2 %d %d\n",1,n);
		return 0;
	}
	if(*max_element(sum, sum+n+1) <= sum[n])
	{
		printf("1\n");
		printf("3 %d %d\n",1,n);
		return 0;
	}
	
	if(*max_element(sum, sum+n+1) <= 0)
	{
		printf("2\n");
		printf("1\n");
		printf("2 %d %d\n",1,n);
		return 0;
	}
	if(*min_element(sum, sum+n+1) >= sum[n])
	{
		printf("2\n");
		printf("1\n");
		printf("3 %d %d\n",1,n);
		return 0;
	}
	
	{
		int t = check(a, n);
		if(t != -1)
		{
			printf("2\n");
			printf("2 %d %d\n",1,t);
			printf("2 %d %d\n",1,n);
			return 0;
		}
		
		reverse(a+1, a+n+1);
		t = check(a, n);
		reverse(a+1, a+n+1);
		
		if(t != -1)
		{
			t = n-t+1;
			printf("2\n");
			printf("3 %d %d\n",t,n);
			printf("3 %d %d\n",1,n);
			return 0;
		}
	}
	
	{
		auto t = check2(a, n);
		if(t.first != -1)
		{
			printf("2\n");
			printf("3 %d %d\n",t.first,t.second);
			printf("2 %d %d\n",1,n);
			return 0;
		}
		
		reverse(a+1, a+n+1);
		t = check2(a, n);
		reverse(a+1, a+n+1);
		
		if(t.first != -1)
		{
			printf("2\n");
			printf("2 %d %d\n",n-t.second+1,n-t.first+1);
			printf("3 %d %d\n",1,n);
			return 0;
		}
	}
	
	int mid = min_element(sum, sum+n+1) - sum;
	ll l = 0, r = 0;
	for(int i=1; i<=mid; ++i)
		l += sum[i-1] - sum[mid];
	for(int i=mid+1; i<=n; ++i)
		r += sum[n] - sum[mid];
	
	vector< array<int,3> > ans;
	
	if(l <= r)
	{
		if(mid+1 <= n)
			ans.push_back({2, mid+1, n});
		ans.push_back({3, 1, n});
	}
	else
	{
		ans.push_back({1, 0, 0});
		if(1 <= mid)
			ans.push_back({3, 1, mid});
		ans.push_back({2, 1, n});
	}
	
	printf("%d\n",(int)ans.size());
	for(auto t: ans)
	{
		if(t[0] == 1) printf("1\n");
		else printf("%d %d %d\n",t[0],t[1],t[2]);
	}
	return 0;
}