#include <fstream>
#include <cmath>

using namespace std;

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

const int NMAX = 15005;

int n, m, c, t, val, p, q;
int v[NMAX], aib[NMAX];

void read() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }
}

int get_sum(int i) {
    int sum = 0;
    while (i) {
        sum += aib[i];
        i -= i & -i;
    }
    return sum;
}

void update(int i, int val) {
    while (i <= n) {
        aib[i] += val;
        i += i & -i;
    }
}

void make_aib() {
    for (int i = 1; i <= n; i++) {
        update(i, v[i]);
    }
}

void solve() {
    make_aib();

    for (int i = 1; i <= m; i++) {
        fin >> c;
        if (c == 0) {
            fin >> t >> val;
            update(t, -val);
        }
        else if (c == 1) {
            fin >> p >> q;
            fout << get_sum(q) - get_sum(p-1) << '\n';
        }
    }
}

int main() {
    read();
    solve();
    return 0;
}