#include <fstream>
#include <iostream>
using namespace std;

void updateaza(int nod, int l, int r, int pos, int val, int v[400005]){
    if(pos<l || pos>r)
        return;
    if(l==r){
        v[nod]+=val;
        return;
    }
    int mid=(l+r)/2;
    updateaza(nod*2, l, mid, pos, val, v);
    updateaza(nod*2+1, mid+1, r, pos, val, v);
    v[nod]=v[nod*2]+v[nod*2+1];
}

int maxim(int nod, int l, int r, int i, int j, int v[400005]){
    if(r<i || l>j)
        return 0;
    if(i<=l && r<=j)
        return v[nod];
    int mid=(l+r)/2;

    return maxim(nod*2, l, mid, i, j, v) + maxim(nod*2+1, mid+1, r, i, j, v);
}

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

    int n,m;
    fin>>n>>m;

    int v[4*n]={};

    int val;
    for(int i=1;i<=n;i++){
        fin>>val;
        updateaza(1, 1, n, i, val, v);
    }


    int op,a,b;
    for(int i=0;i<m;i++){
        fin>>op>>a>>b;
        if(op==1)
            fout<<maxim(1, 1, n, a, b, v)<<"\n";
        else
            updateaza(1, 1, n, a, -b, v);
    }


    fin.close();
    fout.close();

    return 0;
}