#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=(n);(i)++)
#define fd0g(i,n) for ((i)=(n);(i)>=0;(i)--)
#define fz0k(i,n) for ((i)=0;(i)<(n);(i)++)
#define fd0k(i,n) for ((i)=(((long long)(n))-1);(i)>=0;(i)--)
#define fz(i,x,y) for ((i)=(x);(i)<=(y);(i)++)
#define fd(i,y,x) for ((i)=(y);(i)>=(x);(i)--)
#define fzin fz1(i,n)
#define fzim fz1(i,m)
#define fzjn fz1(j,n)
#define fzjm fz1(j,m)
#define ff(c,itr) for (__typeof((c).begin()) itr=(c).begin();itr!=(c).end();++itr)
#define pb push_back
#define mk make_pair
#define rdst(st,len){static char ss[len];scanf(" %s",ss);(st)=ss;}
#define spln(i,n) (i==n?'\n':' ')
#define fac_init(n){fac[0]=fac[1]=inv[1]=fi[0]=fi[1]=1;fz(i,2,n){fac[i]=1ll*fac[i-1]*i%mod;inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;fi[i]=1ll*fi[i-1]*inv[i]%mod;}}
using namespace std;
typedef long long i64;
typedef long double f80;
typedef unsigned int u32;
typedef unsigned long long u64;
//typedef __int128 i128;
//typedef unsigned __int128 u128;
#ifndef ONLINE_JUDGE
	FILE *___=freopen("1.in","r",stdin);
#endif
inline void read(int &x)
{
	char c;int f=1;
	while(!isdigit(c=getchar()))if(c=='-')f=-1;
	x=(c&15);while(isdigit(c=getchar()))x=(x<<1)+(x<<3)+(c&15);
	x*=f;
}
int n,_,i,j,a[200005],s[200005];
i64 p[200005];int suf[200005];
int ans=0x3f3f3f3f;struct iii{int op,l,r;};vector<iii> res;int srev;
struct lne
{
	int x;i64 y;
	i64 f(i64 k){return x*k+y;}
};
i64 b1[200005],b2[200005];
struct lc_tree
{
	int rt,cnt,lc[1600005],rc[1600005];
	lne tr[1600005];
	void init(){rt=cnt=0;}
	void update(int &x,int l,int r,lne t)
	{
		if(!x){x=++cnt;lc[x]=rc[x]=0;tr[x]=t;return;}int mid=(l+r)>>1;
		if(tr[x].f(l)<t.f(l)) swap(tr[x],t);
		if(tr[x].f(mid)<t.f(mid)) swap(tr[x],t),update(lc[x],l,mid,t);
		if(tr[x].f(r)<t.f(r)) update(rc[x],mid+1,r,t);
	}
	pair<i64,int> query(int x,int l,int r,int p)
	{
		if(!x) return make_pair(-0x3f3f3f3f3f3f3f3fll,-1);
		pair<i64,int> res=make_pair(tr[x].f(p),tr[x].x);if(l==r) return res;
		int mid=(l+r)>>1;if(p<=mid)res=max(res,query(lc[x],l,mid,p));else res=max(res,query(rc[x],mid+1,r,p));
		return res;
	}
}tr1,tr2;
void solve(int rev)
{
	int i,j,flg=1;fz1(i,n)if(a[i]<0)flg=0;
	if(flg){ans=0;res.clear();srev=rev;return;}if(ans<=1)return;
	int c=0;flg=1;fz1(i,n)if((c+=a[i])<0)flg=0;
	if(flg){ans=1;res.clear();res.push_back((iii){2,1,n});srev=rev;return;}if(ans<=2)return;
	fz1(i,n)s[i]=s[i-1]+a[i];int mi=0;fz1(i,n)if(s[i]<s[mi])mi=i;
	if(mi<n){
		fz1(i,n)p[i]=a[i];
		fz(i,mi+2,n)p[i]+=p[i-1];
		fd1(i,n-1)p[i]+=p[i+1];
		flg=1;fz1(i,n)flg&=(p[i]>=0);
		if(flg){
			ans=2;res.clear();
			res.push_back((iii){2,mi+1,n});
			res.push_back((iii){3,1,n});
			srev=rev;return;
		}
	}
	suf[n+1]=0x3f3f3f3f;fd1(i,n)suf[i]=min(suf[i+1],s[i]);
	i64 cur=0;
	fz1(i,n){
		cur+=s[i];if(cur<0)break;
		if(cur-s[i]+suf[i+1]>=0){
			ans=2;res.clear();
			res.push_back((iii){2,1,i});
			res.push_back((iii){2,1,n});
			srev=rev;return;
		}
	}
	int l=1;while(l<n&&s[l]>=0)l++;
	i64 tb=0;int tk=0;
	tr1.init();tr2.init();
	fz1(i,n){
		tk-=a[i];tb+=a[i]*(i+1);
		b2[i]=-(1ll*tk*i+tb);
		b1[i]=b2[i]+s[i-1];
		if(i<=l) tr1.update(tr1.rt,-n,n,(lne){i,b1[i]});
		tr2.update(tr2.rt,-n,n,(lne){i,b2[i]});
		i64 c=0;
		i64 mx1=-0x3f3f3f3f3f3f3f3fll,mx2=-0x3f3f3f3f3f3f3f3fll;int pos=0;
		pair<i64,int> tmp1=tr1.query(tr1.rt,-n,n,tk);
		mx1=tmp1.first+tb;pos=tmp1.second;
		mx2=tr2.query(tr2.rt,-n,n,tk).first+tb;
		if(mx1>=max(mx2,-1ll*(suf[i+1]-::s[i]))){
			ans=2;res.clear();
			res.push_back((iii){3,pos,i});
			res.push_back((iii){2,1,n});
			srev=rev;return;
		}
	}
}
int main()
{
	read(n);read(_);fz1(i,n)read(a[i]);
	fz1(i,n)a[i]*=-1;solve(0);reverse(a+1,a+n+1);solve(1);reverse(a+1,a+n+1);ans++;res.insert(res.begin(),(iii){1,0,0});
	fz1(i,n)a[i]*=-1;solve(0);reverse(a+1,a+n+1);solve(1);reverse(a+1,a+n+1);
	if(srev){
		ff(res,it)if(it->op!=1){
			it->op^=1;swap(it->l,it->r);
			it->l=n-it->l+1;it->r=n-it->r+1;
		}
	}
	printf("%d\n",ans);ff(res,it)if(it->op==1)puts("1");else printf("%d %d %d\n",it->op,it->l,it->r);
	return 0;
}