#include <bits/stdc++.h>
#define NMAX 15005
using namespace std;
int n, m;
int v[NMAX], aint[4 * NMAX];

void build(int node = 1, int st = 1, int dr = n)
{
    if(st == dr)
    {
        aint[node] = v[st];
        return;
    }

    int mid = (st + dr) / 2;

    build(2 * node, st, mid);
    build(2 * node + 1, mid + 1, dr);

    aint[node] = aint[2 * node] + aint[2 * node + 1];
}
void update(int pos, int node = 1, int st = 1, int dr = n)
{
    if(st == dr)
    {
        aint[node] = v[st];
        return;
    }
    int mid = (st + dr) / 2;

    if(pos <= mid)
        update(pos, 2 * node, st, mid);
    else
        update(pos, 2 * node + 1, mid + 1, dr);

    aint[node] = aint[2 * node] + aint[2 * node + 1];
}
int query(int x, int y, int node = 1, int st = 1, int dr = n)
{
    if(st >= x && dr <= y)
    {
        return aint[node];
    }
    else if (st > y || dr < x)
        return 0;

    int mid = (st + dr) / 2;

    int Q_st = query(x, y, 2 * node, st, mid);
    int Q_dr = query(x, y, 2 * node + 1, mid + 1, dr);

    return Q_st + Q_dr;
}

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

    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        cin >> v[i];

    build();
    for(int i = 1; i <= m; ++i)
    {
        int type, x, y;
        cin >> type >> x >> y;
        if(type == 0)
        {
            v[x] = v[x] - y;
            update(x);
        }
        else
        {
            cout << query(x, y) << '\n';
        }
    }
    return 0;
}