#include <stdio.h>
#define MAX 15005
int arb[4 * MAX], sum;

int max(int a,int b){

    if(a > b)
        return a;
    return b;
}

void apdeit(int nod,int st,int dr,int poz,int val){

    if(st == dr){
        arb[nod] = val;
        return;
    }

    int mid = (st + dr) / 2;

    if(poz <= mid)
        apdeit(2 * nod,st,mid,poz,val);
    else
        apdeit(2 * nod + 1,mid + 1,dr,poz,val);

    arb[nod] = arb[2 * nod] + arb[2 * nod + 1];
}

void cueri(int nod,int st,int dr,int c1,int c2){

    if(c1 > dr || c2 < st)
        return;
    if(c1 <= st && dr <= c2){
        sum = sum + arb[nod];
        return;
    }

    int mid = (st + dr) / 2;
    if(c1 <= mid)
        cueri(2 * nod,st,mid,c1,c2);
    if(mid < c2)
        cueri(2 * nod + 1,mid + 1,dr,c1,c2);
}

int main(){

    int n, m, i, v[MAX], mod, x, y;
    FILE *f, *g;
    f = fopen("datorii.in","r");
    g = fopen("datorii.out","w");

    fscanf(f,"%d %d",&n,&m);
    for(i = 1;i <= n; ++i){
        fscanf(f,"%d",&v[i]);
        apdeit(1,1,n,i,v[i]);
    }

    for(i = 1;i <= m; ++i){
        fscanf(f,"%d %d %d",&mod,&x,&y);

        if(mod == 0){
            v[x] = v[x] - y;
            apdeit(1,1,n,x,v[x]);
        }
        else{
            sum = 0;
            cueri(1,1,n,x,y);
            fprintf(g,"%d\n",sum);
            }
    }

    return 0;
}