#include <cstdio>
#include<math.h>
#include<assert.h>
using namespace std;
 
int m,n,start,finish,pos,el,sum,bucket_size;
int h[15073],tot[15073];
 
inline int bucket (int poz) {
    return (poz-1)/bucket_size+1;
}
 
void update()
{
    h[pos]+=el;
    tot[bucket (pos)]+=el;
}
 
void query()
{
    int bucket_start=bucket (start);
    int bucket_finish=bucket (finish);
 
    if (bucket_start==bucket_finish) {
        for (int i=start; i<=finish; ++i)
            sum+=h[i];
    }
    else {
        for (int i=start; i<=bucket_size*bucket_start; ++i)
            sum+=h[i];
        for (int i=bucket_start+1; i<bucket_finish; ++i)
            sum+=tot[i];
        for (int i=bucket_size*(bucket_finish-1)+1; i<=finish; ++i)
            sum+=h[i];
    }
}
 
 
int main()
{
    int x,a,b,op;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
 
    scanf("%d%d",&n,&m);
    bucket_size=(int)sqrt (n);
 
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        pos=i;el=x;
        update();
    }
 
     for(int i=0;i<m;i++)
     {
         scanf("%d%d%d",&op,&a,&b);
         if (op==1)
         {
             start=a;finish=b;
             sum=0;
             query();
             printf("%d\n",sum);
         }
         else
         {
             pos=a; el=-b;
             update();
         }
     }
 
     fclose(stdout);
    return 0;
}