#include <bits/stdc++.h>

using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
const int nmax = 15000 + 10;
int arb[4 * nmax], v[nmax];
void update (int node, int left, int right, int pos, int x) {
    if (left == right) {
        arb[node] -= x;
        return;
    }
    int mid = (left + right) / 2;
    if (pos <= mid)
        update (node * 2, left, mid, pos, x);
    else
        update (node * 2 + 1, mid + 1, right, pos, x);
    arb[node] = arb[node * 2] + arb[node * 2 + 1];
}
int query (int node, int left, int right, int l, int r) {
    if (l <= left && right <= r) {
        return arb[node];
    }
    int mx = 0;
    int mid = (left + right) / 2;
    if (l <= mid)
        mx += query (node * 2, left, mid, l, r);
    if (r > mid)
        mx += query (node * 2 + 1, mid + 1, right, l, r);
    return mx;
}
void create (int node, int left, int right) {
    if (left == right) {
        arb[node] = v[left];
        return;
    }
    int mid = (left+right)/2;
    create(node*2, left, mid);
    create(node*2+1, mid+1, right);
    arb[node] = arb[node * 2] + arb[node * 2 + 1];
}
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    create(1, 1, n);
    for (int i = 1; i <= m; ++i) {
        int nr, a, b;
        fin >> nr >> a >> b;
        if (nr == 0) {
            update (1, 1, n, a, b);
            v[a] -= b;
        }
        else
            fout << query (1, 1, n, a, b) << '\n';
    }
    return 0;
}