#include<iostream>
#include<cstdio>
#define N 200000
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
struct reads
{
    int op,l,r;
};
reads tong[N+1];
int n,g,length;
long long a[N+1],maxn=(long long)(1e18);
__int128 s[N+1];
long long F(__int128 x)
{
    if (x>maxn) x=maxn;
    if (x<-maxn) x=-maxn;
    return x;
}
void solve(int op,int l,int r)
{
    if (op==1)
    {
	for (int i=1;i<=n;++i) a[i]=-a[i];
    }
    else if (op==2)
    {
	s[l]=a[l];
	for (int i=l+1;i<=r;++i) s[i]=s[i-1]+a[i];
	for (int i=l;i<=r;++i) a[i]=F(s[i]);
    }
    else
    {
	s[r]=a[r];
	for (int i=r-1;i>=l;--i) s[i]=s[i+1]+a[i];
	for (int i=l;i<=r;++i) a[i]=F(s[i]);
    }
    tong[++length]=(reads){op,l,r};
    return;
}
int main()
{
    int ps;
    bool op;
    n=read(),g=read();
    for (int i=1;i<=n;++i) a[i]=read();
    if (g==1)
    {
	op=1;
	for (int i=1;i<=n;++i) op&=(a[i]>=0);
	if (op) puts("0");
	else
	{
	    puts("1"),op=1;
	    for (int i=1;i<=n;++i) op&=(a[i]<=0);
	    if (op) puts("1");
	    else
	    {
		for (int i=1;i<=n;++i) s[i]=s[i-1]+a[i];
		op=1;
		for (int i=1;i<=n;++i) op&=(s[i]>=0);
		if (op) printf("2 %d %d\n",1,n);
		else printf("3 %d %d\n",1,n);
	    }
	}
    }
    else if (g==2)
    {
	ps=0;
	for (int i=1;i<=n;++i)
	    if (abs(a[i])==1)
		ps=i;
	if (!ps) puts("0");
	else
	{
	    if (a[ps]<0) solve(1,0,0);
	    if (ps!=n)
	    {
		solve(2,ps,ps+1);
		solve(2,ps,ps+1);
		for (int i=1;i<=40;++i) solve(2,ps,ps+1),solve(3,ps,ps+1);
	    }
	    else if (ps!=1)
	    {
		solve(3,ps-1,ps);
		solve(3,ps-1,ps);
		for (int i=1;i<=40;++i) solve(2,ps-1,ps),solve(3,ps-1,ps);
	    }
	    solve(2,1,n),solve(3,1,n);
	    printf("%d\n",length);
	    for (int i=1;i<=length;++i)
	    {
		if (tong[i].op==1) puts("1");
		else printf("%d %d %d\n",tong[i].op,tong[i].l,tong[i].r);
	    }
	}
    }
    return 0;
}