#include <fstream>

using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

const int nmax=15000, n2max=(1<<14);

int v[2*n2max];

int solutie(int a, int b, int nod, int l, int r){
    if(r<a||b<l){
        return 0;
    }else if(a<=l&&r<=b){
        return v[nod];
    }else{
        int x=solutie(a, b, nod*2, l, (l+r)/2);
        int y=solutie(a, b, nod*2+1, (l+r)/2+1, r);
        return x+y;
    }
}

int main(){
    int n, m;
    fin>>n>>m;
    int n2=1;
    while(n2<n){
        n2*=2;
    }
    for(int i=1;i<=n;i++){
        fin>>v[n2+i-1];
    }
    for(int i=n2-1;i>=1;i--){
        v[i]=v[i*2]+v[i*2+1];
    }
    for(int i=1;i<=m;i++){
        int k,a,b;
        fin>>k>>a>>b;
        if(k==0){
            v[n2+a-1]-=b;
            for(int x=(n2+a-1)/2;x>=1;x/=2){
                v[x]=v[x*2]+v[x*2+1];
            }
        }else{
            fout<<solutie(a,b,1,1,n2)<<"\n";
        }
    }
    return 0;
}