#include <iostream>
#include <fstream>

#define NMAX 100004

using namespace std;

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

int tree[4 * NMAX], a[NMAX], N, M;

void build(int nod, int le, int ri) {
    if (le == ri) {
        tree[nod] = a[le];
        return;
    }

    int mid = (le + ri) / 2;
    build(2 * nod, le, mid);
    build(2 * nod + 1, mid + 1, ri);

    tree[nod] = tree[2 * nod] + tree[2 * nod + 1];
}

void update(int nod, int le, int ri, int pos, int x) {
    if (le == ri) {
        tree[nod] -= x;
        return;
    }

    int mid = (le + ri) / 2;
    if (pos <= mid)
        update(2 * nod, le, mid, pos, x);
    else
        update(2 * nod + 1, mid + 1, ri, pos, x);

    tree[nod] = tree[2 * nod + 1] + tree[2 * nod];
}

int query(int nod, int le, int ri, int ql, int qr) {
    if (ql <= le && ri <= qr)
        return tree[nod];

    int mid = (le + ri) / 2;
    if (qr <= mid)
        return query(2 * nod, le, mid, ql, qr);
    if (mid + 1 <= ql)
        return query(2 * nod + 1, mid + 1, ri, ql, qr);

    return (query(2 * nod, le, mid, ql, qr) + query(2 * nod + 1, mid + 1, ri, ql, qr));
}

int main() {

    fin >> N >> M;
    for (int i = 1; i <= N; i++) {
        fin >> a[i];
    }
    build(1, 1, N);

    for(int q = 0; q < M; q++) {
        int p, x, y;
        fin >> p >> x >> y;

        if (p == 1) {
            fout << query(1, 1, N, x, y) << '\n';
        } else {
            update(1, 1, N, x, y);
        }
    }


    return 0;
}