#include <stdio.h>
 
using namespace std;
 
int n,t[15100];
 
void insert(int val,int poz) {
    int put=0;
    while(poz<=n) {
        t[poz]+=val;
        while((poz & (1<<put)) == 0) put++;
        poz+=1<<put;
        put++;
    }
}
 
int query(int poz) {
    int put=0, sum=0;
    while(poz>0) {
    sum+=t[poz];
    while((poz & (1<<put)) ==0) put++;
    poz-=1<<put; put++;
    }
    return sum;
}
int main()
{
    int m,i,tp,x,y;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1; i<=n; i++) {
        scanf("%d",&x);
        insert(x,i);
    }
    for(i=1; i<=m; i++) {
        scanf("%d %d %d",&tp,&y,&x);
        if(tp==0) insert(-x,y);
        else printf("%d\n",query(x)-query(y-1));
    }
    return 0;
}