#include <fstream>

using namespace std;
ifstream cin ("datorii.in");
ofstream cout ("datorii.out");
int seg[100000];
int query(int nod, int l, int r, int ql, int qr)
{
    int mid = (l + r) / 2, maxst = 0, maxdr = 0;
    if (ql <= l && r <= qr)
        return seg[nod];
    if (mid >= ql)
        maxst = query(2 * nod, l, mid, ql, qr);
    if (mid < qr)
        maxdr = query(2 * nod + 1, mid + 1, r, ql, qr);
    return maxst + maxdr;
}
void update(int nod, int l, int r, int poz, int val)
{
    int mid;
    if (r == l)
    {
        seg[nod] -= val;
        return;
    }
    mid = (l + r) / 2;
    if (poz <= mid)
        update (2 * nod, l, mid, poz, val);
    else
        update (2 * nod + 1, mid + 1, r, poz, val);
    seg[nod] = seg[2 * nod] + seg[2 * nod + 1];
}
int main()
{
    int n, m, i, val, op, a, b;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
    {
        cin >> val;
        val = 0 - val;
        update (1, 1, n, i, val);
    }
    for (i = 1; i <= m; i++)
    {
        cin >> op >> a >> b;
        if (op == 0)
            update (1, 1, n, a, b);
        else
            cout << query (1, 1, n, a, b) << '\n';
    }

    return 0;
}