#include <fstream>

#define Nmax 15001

using namespace std;

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

int n, m, i, op, x, y, arb[4 * Nmax], p, q, v, t;

void Update (int nod, int st, int dr, int a, int b, int val)
{
    if (dr < a || st > b)
        return;
    if (st >= a && dr <= b)
        arb[nod] -= val;
    else
    {
        int mij = (st + dr) / 2;
        Update (nod * 2, st, mij, a, b, val);
        Update (nod * 2 + 1, mij + 1, dr, a, b, val);
        arb[nod] = (arb[nod * 2] + arb[nod * 2 + 1]);
    }

}

int Query (int nod, int st, int dr, int a, int b)
{
    if (dr < a || st > b)
        return 0;
    if (st >= a && dr <= b)
        return arb[nod];
    else
    {
        int mij = (st + dr) / 2;
        return Query (nod * 2, st, mij, a, b) + Query (nod * 2 + 1, mij + 1, dr, a, b);

    }
}

int main()
{
    fin >> n >> m;
    for (i = 1; i <= n; i ++)
    {
        fin >> x;
        Update (1, 1, n, i, i, -x);
    }

    for (i = 1; i <= m; i ++)
    {
        fin >> op;
        if (op == 0)
        {
            fin >> t >> v;
            Update (1, 1, n, t, t, v);
        }
        else
        {
            fin >> p >> q;
            fout << Query (1, 1, n, p, q) << '\n';
        }
    }

    fin.close();
    fout.close();
    return 0;
}