#include <iostream>
#include <fstream>
#define MAX 15000
using namespace std;
int n,m,t,x,y,seg[4*MAX+1],v[MAX+1];

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

void build(int nod, int l, int r){
    if(l == r){
        seg[nod] = v[l];
    }else{
        int mid = (l+r)/2;
        build(nod*2, l, mid);
        build(nod*2+1, mid+1, r);
        seg[nod] = seg[2*nod]+seg[2*nod+1];
    }
}

int query(int nod, int l, int r, int ql, int qr){
    if(ql <= l && r <= qr){
        return seg[nod];
    }else{
        int mid = (l+r)/2;
        if(qr <= mid){
            return query(nod*2, l, mid, ql, qr);
        }else if(mid+1 <= ql){
            return query(nod*2+1, mid+1, r, ql, qr);
        }
        return query(nod*2, l, mid, ql, qr) + query(nod*2+1, mid+1, r, ql, qr);
    }
}

void update(int nod, int l, int r, int pos, int val){
    if(l == r){
        seg[nod] -= val;
    }else{
        int mid = (l+r)/2;
        if(pos <= mid){
            update(nod*2, l, mid, pos, val);
        }else{
            update(nod*2+1, mid+1, r, pos, val);
        }
        seg[nod] = seg[nod*2]+seg[nod*2+1];
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
    }
    build(1, 1, n);
    while(m--){
        fin >> t >> x >> y;
        if(t == 0){
            update(1, 1, n, x, y);
        }else{
            fout << query(1, 1, n, x, y) << "\n";
        }
    }
    return 0;
}