#include <fstream>
//#include <iostream>
#include <deque>
#include <set>
#include <climits>
using namespace std;

ifstream cin("datorii.in");
ofstream cout("datorii.out");

const int NMAX = 15004;
int v[NMAX], arb[2 * NMAX - 1];

void build(int pos, int st, int dr)
{
    if (st == dr)
    {
        arb[pos] = v[st];
        return ;
    }
    build(2 * pos, st, (st + dr) / 2);
    build(2 * pos + 1, (st + dr) / 2 + 1, dr);
    arb[pos] = arb[2 * pos] + arb[2 * pos + 1];
}

void update(int vf, int val, int pos, int st, int dr)
{
    if (st == dr)
    {
        arb[vf] -= val;
        return ;
    }
    int med = (st + dr) / 2;
    if (pos <= med)
        update(2 * vf, val, pos, st, med);
    else
        update(2 * vf + 1, val, pos, med + 1, dr);
    arb[vf] = arb[2 * vf] + arb[2 * vf + 1];
}

int s(int pos, int st, int dr, int x, int y)
{
    if (st == x and dr == y)
        return arb[pos];
    int med = (st + dr) / 2;
    if (x <= med)
    {
        if (y <= med)
            return s(2 * pos, st, med, x, y);
        return s(2 * pos, st, med, x, med) +
               s(2 * pos + 1, med + 1, dr, med + 1, y);
    }
    return s(2 * pos + 1, med + 1, dr, x, y);
}
int main()
{
    int n, m, i;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
        cin >> v[i];
    build(1, 1, n);
    while (m--)
    {
        int cod, p, q;
        cin >> cod >> p >> q;
        if (cod == 0)
            update(1, q, p, 1, n);
        else
            cout << s(1, 1, n, p, q) << "\n";
    }
    return 0;
}