#include <iostream>
#include <fstream>

using namespace std;

#define MAX 15010

void carb(int v[], int arb[], int nod, int st, int dr) {
    if (st == dr) {
        arb[nod] = v[st];
    } else {
        int mid = (st + dr) / 2;

        carb(v, arb, 2 * nod, st, mid);
        carb(v, arb, 2 * nod + 1, mid + 1, dr);

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

void update(int arb[], int poz, int val, int nod, int st, int dr) {
    if (st == dr) {
        arb[poz] -= val;
        return;
    }

    int mid = (st + dr) / 2;

    if (poz <= mid) {
        update(arb, poz, val, nod * 2, st, mid);
    } else {
        update(arb, poz, val, nod * 2 + 1, mid + 1, dr);
    }

    arb[nod] -= val;
}

int query(int arb[], int st_q, int dr_q, int nod, int st, int dr) {
    if (st_q <= st && dr <= dr_q) {
        return arb[nod];
    }
/*
    if (dr < st_q || dr_q < st) {
        return 0;
    }*/

    int mid = (st + dr) / 2;

    int d = 0, s = 0;

    if (st_q <= mid) {
        s = query(arb, st_q, dr_q, 2 * nod, st, mid);
    }

    if (dr_q > mid) {
        d = query(arb, st_q, dr_q, 2 * nod + 1, mid + 1, dr);
    }

    return s + d;
}

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

    int n, m, v[MAX], arb[4 * MAX], op, a, b;

    fin >> n >> m;

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

    carb(v, arb, 1, 1, n);

    for (int i = 0; i < m; ++i) {
        fin >> op >> a >> b;

        if (op == 0) {
            update(arb, a, b, 1, 1, n);
        } else {
            fout << query(arb, a, b, 1, 1, n) << endl;
        }
    }

    fin.close();
    fout.close();

    return 0;
}