#include <stdio.h>
int arb[500105];
int max;
void mod(int nod,int p,int u,int x,int y)
{
	int m;
	if(u==p)
	{
		arb[nod]+=y;
		return ;
	}
	m=(p+u)/2;
	if (x<=m)
		mod(nod*2,p,m,x,y);
	else
		mod(nod*2+1,m+1,u,x,y);
	arb[nod]+=y;
}
void cauta(int nod,int p,int u, int x,int y)
{
	int m;
	if (x<=p&&u<=y)
	{
		if (arb[nod]>max)
			max+=arb[nod];
		return;
	}
	m=(p+u)/2;
	if (x<=m)
	{
		cauta(nod*2,p,m,x,y);
	}
	if (m<y)
	{
		cauta(nod*2+1,m+1,u,x,y);
	}
}
int main()
{
	FILE *in,*out;
	int m,n,i,x,a,b;
	in=fopen("datorii.in","r");
	out=fopen("datorii.out","w");
	fscanf(in,"%d%d",&n,&m);
	for (i=1;i<=n;i++)
	{
		fscanf(in,"%d",&x);
		mod(1,1,n,i,x);
	}
	for (i=1;i<=m;i++)
	{
		fscanf(in,"%d%d%d",&x,&a,&b);
		if (!x)
		{ 
			mod(1,1,n,a,-b);
		}
		else
		{
			max=0;
			cauta(1,1,n,a,b);
			fprintf(out,"%d\n",max);	
		}
	}
	fclose(in);
	fclose(out);
	return 0;
		
}