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

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

#define NMAX 15001

int n, Q;
int v[NMAX], aint[4*NMAX];
int op, a, b;

void build(int nod, int st, int dr) {
    if (st == dr) {
        aint[nod] = v[st];
        return;
    }
    
    int mid = (st+dr)/2;
    build(nod*2, st, mid);
    build(nod*2+1, mid+1, dr);
    aint[nod] = aint[nod*2] + aint[nod*2+1];
}

void update(int nod, int st, int dr, int poz, int val) {
    if (st == dr) {
        aint[nod] += val;
        return;
    }
    int mid = (st+dr)/2;
    if (poz <= mid) {
        update(nod*2, st, mid, poz, val);
    } else {
        update(nod*2+1, mid+1, dr, poz, val);
    }
    aint[nod] = aint[nod*2] + aint[nod*2+1];
}

int query(int nod, int st, int dr, int L, int R) {
    if (dr < L || R < st) return 0;
    
    if (L <= st && dr <= R) {
        return aint[nod];
    }
    int mid = (st+dr)/2;
    int sol1 = 0, sol2 = 0;
    if (L <= mid) {
        sol1 = query(nod*2, st, mid, L, R);
    }
    
    if (mid < R) {
        sol2 = query(nod*2+1, mid+1, dr, L, R);
    }
    
    return sol1 + sol2;
}

int main() {
      
    fin >> n >> Q;
    for (int i = 1; i<=n; i++) {
        fin >> v[i];
    }
    
    build(1, 1, n);
    
    for (int i = 1; i<=Q; i++) {
        fin >> op >> a >> b;
        if (op == 0) {
            update(1, 1, n, a, -b);
        } else {
            fout << query(1, 1, n, a, b) << "\n";
        }
    }
    
    return 0;
}