#include<cstdio>
using namespace std;

const int NMAX = 15001;

int aint[NMAX*4],n;

void update_recursiv(int node, int left, int right,int position,int value) {
    if (left==right) {
        aint[node] = value;
        return;
    }
    int mid = (left+right)/2;
    if (position<=mid) {
        update_recursiv(node*2,left,mid,position,value);
    }
    else if (position>mid) {
        update_recursiv(node*2+1,mid+1,right,position,value);
    }
    aint[node]=aint[node*2]+aint[node*2+1];
}
void update(int pos,int val) {
    update_recursiv(1,1,n,pos,val);
}

void scade_recursiv(int node, int left, int right,int position,int value) {
    if (left==right) {
        aint[node] = aint[node]-value;
        return;
    }
    int mid = (left+right)/2;
    if (position<=mid) {
        scade_recursiv(node*2,left,mid,position,value);
    }
    else if (position>mid) {
        scade_recursiv(node*2+1,mid+1,right,position,value);
    }
    aint[node]=aint[node*2]+aint[node*2+1];
}
void scade(int pos,int val) {
    scade_recursiv(1,1,n,pos,val);
}

int query_recursiv(int node, int left, int right,int query_left,int query_right) {
    if (left == query_left && right == query_right) {
        return aint[node];
    }
    int mid = (left+right)/2;
    if (query_right<=mid)
        return query_recursiv(2*node,left,mid,query_left,query_right);
    if (query_left>mid) {
        return query_recursiv(2*node+1,mid+1,right,query_left,query_right);

    }
    return query_recursiv(node*2,left,mid,query_left,mid)+query_recursiv(node*2+1,mid+1,right,mid+1,query_right);
}
int query(int x,int y) {
    return query_recursiv(1,1,n,x,y);
}
int main(){
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);

    int m;
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++) {
        int x;
        scanf("%d",&x);
        update(i,x);
    }
    for (int i=1;i<=m;i++) {
        int op,a,b;
        scanf("%d %d %d",&op,&a,&b);
        if (op==0) {
            scade(a,b);
        }
        else if (op==1){
            printf("%d\n",query(a,b));
        }
    }
    return 0;
}