#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],s[N],suf[N],sufs[N],psuf[N],stk[N],stktp;
vector<pair<ll,pair<ll,ll> > > ans;
void ins(ll x)
{
	while(stktp>1)
	{
		ll r=stk[stktp-1],l=stk[stktp-2];
		if((psuf[x]-psuf[r])*(r-l)>=(psuf[r]-psuf[l])*(x-r))
		{
			break;
		}
		stktp--;
	}
	stk[stktp++]=x;
	return;
}
ll query(ll v)
{
	ll l=0,r=stktp-1;
	while(l<r)
	{
		ll mid=(l+r)>>1;
		if(psuf[stk[mid+1]]-psuf[stk[mid]]>=v*(stk[mid+1]-stk[mid]))
		{
			r=mid;
		}
		else
		{
			l=mid+1;
		}
	}
	return stk[l];
}
bool check1()
{
	ll i;
	s[0]=0;
	for(i=0;i<n;i++)
	{
		s[i+1]=s[i]+a[i];
		if(s[i+1]<0)
		{
			return false;
		}
	}
	ans.push_back(make_pair(2,make_pair(0,n-1)));
	return true;
}
bool check2()
{
	ll i,j,k;
	ans.push_back(make_pair(1,make_pair(0,0)));
	for(i=0;i<n;i++)
	{
		a[i]=-a[i];
	}
	if(check1())
	{
		return true;
	}
	ans.clear();
	for(i=0;i<n;i++)
	{
		a[i]=-a[i];
	}
	suf[n]=sufs[n]=0;
	for(i=n-1;i>=0;i--)
	{
		suf[i]=min((ll)0,suf[i+1]+a[i]);
		sufs[i]=sufs[i+1]+a[i];
	}
	ll cs=0,ts=0;
	for(i=0;i<n;i++)
	{
		cs+=a[i];
		ts+=cs;
		if(ts<0)
		{
			break;
		}
		if(ts+suf[i+1]>=0)
		{
			ans.push_back(make_pair(2,make_pair(0,i)));
			ans.push_back(make_pair(2,make_pair(0,n-1)));
			return true;
		}
	}
	for(i=1;i<=n;i++)
	{
		psuf[i]=psuf[i-1]+sufs[i-1];
	}
	stktp=cs=0;
	ll mxok=n;
	for(i=0;i<n;i++)
	{
		cs+=a[i];
		if(cs<0)
		{
			mxok=i;
			break;
		}
	}
	for(i=0;i<n;i++)
	{
		ins(i);
		ll x=query(sufs[i+1]);
		if(x<=mxok&&psuf[i+1]-psuf[x]+suf[i+1]>=sufs[i+1]*(i-x+1))
		{
			ans.push_back(make_pair(3,make_pair(x,i)));
			ans.push_back(make_pair(2,make_pair(0,n-1)));
			return true;
		}
	}
	return false;
}
bool check3()
{
	ll i,mnp=0,mxp=0;
	s[0]=0;
	for(i=0;i<n;i++)
	{
		s[i+1]=s[i]+a[i];
		if(s[i+1]<s[mnp])
		{
			mnp=i+1;
		}
		if(s[i+1]>s[mxp])
		{
			mxp=i+1;
		}
	}
	if(mnp>mxp)
	{
		ans.push_back(make_pair(1,make_pair(0,0)));
		swap(mnp,mxp);
	}
	if(mnp<n)
	{
		ans.push_back(make_pair(2,make_pair(mnp,n-1)));
	}
	ans.push_back(make_pair(3,make_pair(0,n-1)));
	return true;
}
void print(ll tp)
{
	ll i;
	printf("%d\n",ans.size());
	for(i=0;i<ans.size();i++)
	{
		if(ans[i].F==1)
		{
			puts("1");
		}
		else if(!tp)
		{
			printf("%lld %lld %lld\n",ans[i].F,ans[i].S.F+1,ans[i].S.S+1);
		}
		else
		{
			printf("%lld %lld %lld\n",ans[i].F^1,n-ans[i].S.S,n-ans[i].S.F);
		}
	}
	return;
}
int main(){
	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]);
	}
	if(mn>=0)
	{
		puts("0");
		return 0;
	}
	if(mx<=0)
	{
		puts("1");
		puts("1");
		return 0;
	}
	if(check1())
	{
		print(0);
		return 0;
	}
	reverse(a,a+n);
	if(check1())
	{
		print(1);
		return 0;
	}
	reverse(a,a+n);
	if(check2())
	{
		print(0);
		return 0;
	}
	reverse(a,a+n);
	if(check2())
	{
		print(1);
		return 0;
	}
	reverse(a,a+n);
	assert(check3());
	print(0);
	return 0;
}