#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define F first
#define S second
#define ll long long
#define N 200010
using namespace std;
ll n,a[N],b[N],s[N];
int main(){
//	freopen("draftpaper.in","r",stdin);
//	freopen("draftpaper.out","w",stdout);
	ll T,i,mx=0,mn=0;
	scanf("%lld%lld",&n,&T);
	for(i=0;i<n;i++)
	{
		scanf("%lld",&a[i]);
		mx=max(mx,a[i]);
		mn=min(mn,a[i]);
		b[i]=a[i];
		s[i+1]=s[i]+a[i];
	}
	if(mn>=0)
	{
		puts("0");
		return 0;
	}
	if(mx<=0)
	{
		puts("1");
		puts("1");
		return 0;
	}
	vector<pair<ll,ll> > ans,ans2;
	if(a[0]<0)
	{
		for(i=0;i<n;i++)
		{
			a[i]=-a[i];
		}
		ans.push_back(make_pair(-1,-1));
	}
	while(true)
	{
		for(i=1;i<=n;i++)
		{
			if(s[i]<0)
			{
				break;
			}
			a[i-1]=s[i];
		}
		ans.push_back(make_pair(1,i-1));
		if(i==n+1)
		{
			break;
		}
		for(i=1;i<=n;i++)
		{
			s[i]=s[i-1]+a[i-1];
		}
	}
	s[n]=0;
	for(i=n-1;i>=0;i--)
	{
		s[i]=s[i+1]+b[i];
	}
	if(b[n-1]<0)
	{
		for(i=0;i<n;i++)
		{
			b[i]=-b[i];
		}
		ans2.push_back(make_pair(-1,-1));
	}
	while(true)
	{
		for(i=n-1;i>=0;i--)
		{
			if(s[i]<0)
			{
				break;
			}
			b[i]=s[i];
		}
		ans2.push_back(make_pair(i+2,n));
		if(i==-1)
		{
			break;
		}
		for(i=n-1;i>=0;i--)
		{
			s[i]=s[i+1]+b[i];
		}
	}
	if(ans.size()<ans2.size())
	{
		printf("%d\n",ans.size());
		for(i=0;i<ans.size();i++)
		{
			if(ans[i].F==-1)
			{
				puts("1");
			}
			else
			{
				printf("2 %lld %lld\n",ans[i].F,ans[i].S);
			}
		}
	}
	else
	{
		printf("%d\n",ans2.size());
		for(i=0;i<ans2.size();i++)
		{
			if(ans2[i].F==-1)
			{
				puts("1");
			}
			else
			{
				printf("3 %lld %lld\n",ans2[i].F,ans2[i].S);
			}
		}
	}
	return 0;
}