#include<stdio.h>

FILE *in = fopen ("datorii.in", "rt");
FILE *out = fopen ("datorii.out", "wt");

struct nod
{
	int s,d,v;
};

int N,M,q[15000];

nod A[35000];

void construieste (int k, int x, int y)
{
    A[k].s=x;
    A[k].d=y;
    A[k].v=0;
    if(x!=y)
    {
    	construieste (2*k,x,(x+y)/2);
    	construieste (2*k+1,(x+y)/2+1,y);
    }
}

void adauga (int k,int x, int y)
{
    A[k].v+=y;
    if(A[k].s!=A[k].d)
    {
    	if(x<=(A[k].s+A[k].d)/2)
    	{
    		adauga(2*k,x,y);
    	}
    	else
    	{
    		adauga(2*k+1,x,y);
    	}
    }
}

void scade (int k, int x, int y)
{
    A[k].v-=y;
    if(A[k].s!=A[k].d)
    {
    	if(x<=(A[k].s+A[k].d)/2)
    	{
    		scade(2*k,x,y);
  		}
    	else
    	{
    		scade(2*k+1,x,y);
    	}
    }
}

void query(int k,int x, int y)
{
	if(x<=A[k].s && y>=A[k].d)
    {
    	q[0]++;
        q[q[0]]=k;
    }
    else
    {
    	int z=(A[k].s+A[k].d)/2;
        if(y>z)
        	query(k*2+1,x,y);
        if(x<=z)
        	query(k*2,x,y);
    }
}

void citire ()
{
    fscanf (in, "%d %d", &N, &M);
	construieste (1,1,N);
    for(int i=1;i<=N;i++)
    {
		int x;
        fscanf(in, "%d", &x);
        adauga(1,i,x);
    }
}

void rezolvare ()
{
    for(int i=1;i<=M;i++)
    {
    	int x,y,z;
        fscanf(in, "%d %d %d", &x, &y, &z);
        if(!x)
        {
        	scade(1,y,z);
        }
        else
        {
        	q[0]=0;
            int k=0;
            query(1,y,z);
            for(int j=1;j<=q[0];j++)
                k+=A[q[j]].v;
            fprintf(out,"%d\n",k);
        }
    }
}

int main ()
{
	citire ();
    rezolvare ();
    fclose(in);
    fclose(out);
    return 0;
}