// aint
#include <fstream>

using namespace std;

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

int n, q, c, x, y, poz, val, sumTree[60005];

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

int suma(int nod, int st, int dr, int x, int y) {
    if(st > y || dr < x) {
        return 0;
    }
    if(st >= x && dr <= y) {
        return sumTree[nod];
    } else {
        int mid = (st + dr) / 2;
        return suma(2 * nod, st, mid, x, y) + suma(2 * nod + 1, mid + 1, dr, x, y);
    }
}

int main() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++) {
        fin >> x;
        poz = i, val = x;
        update(1, 1, n);
    }
    for(int i = 1; i <= q; i++) {
        fin >> c >> x >> y;
        if(c == 0) {
            poz = x, val = -y;
            update(1, 1, n);
        } else {
            fout << suma(1, 1, n, x, y) << "\n";
        }
    }
    return 0;
}