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