#include<fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
const int NMAX=15005;
int aib[NMAX],n,m;
int zeros(int x){
    return x&(x^(x-1));
}
void update(int pos,int val){
    int i;
    for(i=pos;i<=n;i+=zeros(i))
        aib[i]+=val;
}
int querry(int pos){
    int i,ans=0;
    for(i=pos;i>0;i-=zeros(i))
        ans+=aib[i];
    return ans;
}
void solve(){
    int i,x,code,pos,val;
    fin>>n>>m;
    for(i=1;i<=n;++i){
        fin>>x;
        update(i,x);
    }
    while(m--){
        fin>>code>>pos>>val;
        if(code==0)
            update(pos,-val);
        else
            fout<<querry(val)-querry(pos-1)<<'\n';
    }
}
int main(){
    solve();
}