#include <iostream>
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
#define dmax 100000
int start,finish,left,right,val,pos,suma,v[4*dmax+40];
void update(int p,int left,int right){
    if(left==right){
        if(v[p]+val>0)
        v[p]+=val;
    else
        val=0;
        return ;
    }
    int mij=(left+right)/2;
    if(pos<=mij)
        update(2*p,left,mij);
    else
        update(2*p+1,mij+1,right);
        v[p]=v[2*p+1]+v[2*p];
}
void query(int p,int left,int right){
    if(start<=left && right<=finish){
       suma+=v[p];
        return ;
    }
    int mij=(left+right)/2;
    if(start<=mij)
        query(2*p,left,mij);
    if(mij<finish)
        query(2*p+1,mij+1,right);
}
int main()
{   int n,m,x,a,b;
    in>>n>>m;
    for(int i=1;i<=n;i++){
            in>>a;
            val=a;
            pos=i;
        update(1,1,n);
    }
    for(int i=1;i<=m;i++){
        in>>x>>a>>b;
        if(!x){
               pos=a;
               val=-b;
            update(1,1,n);
        }
        else{
            start=a;
            finish=b;
            suma=0;
            query(1,1,n);
            out<<suma<<'\n';
        }
    }
    return 0;
}