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

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


#define MAXN 500000
int arbint[MAXN];

int query(int nod, int left, int right, int a, int b) {

    if (left >= a && b >= right)
        return arbint[nod];

    int mid = (left + right) / 2, v1 = 0, v2 = 0;

    if (a <= mid)
        v1 = query(nod * 2, left, mid, a, b);

    if (b > mid)
        v2 = query(nod * 2 + 1, mid + 1, right, a, b);

    return v1 + v2;
}

void update(int nod, int left, int right, int poz, int val) {
    if (left == right) {
        arbint[nod] = val;
        return;
    }
    int mid = (left + right) / 2;

    if (poz <= mid)

        update(nod * 2, left, mid, poz, val);

    else

        update(nod * 2 + 1, mid + 1, right, poz, val);

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

void update2(int nod, int left, int right, int poz, int val) {
    if (left == right) {
        arbint[nod] = arbint[nod] - val;
        return;
    }
    int mid = (left + right) / 2;

    if (poz <= mid)

        update2(nod * 2, left, mid, poz, val);

    else

        update2(nod * 2 + 1, mid + 1, right, poz, val);

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

int main() {
    int n, m, nr1, nr2, op;

    fin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        fin >> nr1;
        
        update(1, 1, n, i, nr1);
    }

    for (int i = 0; i < m; ++i) {

        fin >> op >> nr1 >> nr2;
        if (op == 1)
            fout << query(1, 1, n, nr1, nr2) << "\n";
        else
            update2(1, 1, n, nr1, nr2);
    }

    fin.close();
    fout.close();
    return 0;

}