#include <fstream>
#include <vector>

using namespace std;

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

vector<int> arb,v;

void update(int nod, int left, int right) {
    if (left == right) {
        arb[nod] = v[left];
        return;
    }

    int div = (left + right) / 2;

    update(2 * nod, left, div);
    update(2 * nod + 1, div + 1, right );

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

}

void plata(int nod, int left, int right, int a, int b) {
    if (a < left || a > right)
        return;
    if (left == right) {
        arb[nod] += b;
        return;
    }

    int div = (left + right) / 2;
    if (a <= div)
        plata(nod * 2, left, div, a, b);
    else
        plata(nod * 2 + 1, div + 1, right, a, b);

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

}

int query(int nod, int left, int right, int start, int finish) {
    if (right < start || left > finish)
        return 0;
    if (start <= left && right <= finish)
        return arb[nod];

    int div = (left + right) / 2;
    return query(2 * nod, left, div, start, finish) + query(2 * nod + 1, div + 1, right, start, finish);
}

int main() {
    int n, m, x, op, a, b;
    arb.resize(60066);
    v.resize(15066);

    fin >> n >> m;

    v.resize(15066);

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

    update(1,1,n);

    for (int i = 0; i < m; i++) {
        fin >> op;
        if (op == 1) {
            fin >> a >> b;
            fout << query(1, 1, n, a, b) << "\n";
        } else {
            fin >> a >> b;
            plata(1, 1, n,a , (-1 * b));
        }
    }
}