#include <fstream>

using namespace std;


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


const int N = 15000;
int n, m;
int v[N+1], aint[4*N+1];


void build(int nod, int st, int dr)
{
    if (st == dr)
    {
        aint[nod] = v[st];
        return;
    }
    int mid = (st+dr)/2;
    build(nod<<1, st, mid);
    build(nod<<1 | 1, mid+1, dr);
    aint[nod] = aint[nod<<1] + aint[nod<<1 | 1];
}


void update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        aint[nod] -= val;
        return;
    }
    int mid = (st+dr)/2;
    if (poz <= mid)
        update(nod<<1, st, mid, poz, val);
    else
        update(nod<<1 | 1, mid+1, dr, poz, val);
    aint[nod] = aint[nod<<1] + aint[nod<<1 | 1];
}


int query(int nod, int st, int dr, int L, int R)
{
    if (R < st || dr < L)
        return 0;
    if (L <= st && dr <= R)
        return aint[nod];
    int mid = (st+dr)/2;
    return query(nod<<1, st, mid, L, R) + query(nod<<1 | 1, mid+1, dr, L, R);
}


int main()
{
    fin >> n >> m;

    for (int i = 1; i <= n; i++)
        fin >> v[i];
    
    build(1, 1, n);
    

    for (int i = 1; i <= m; i++)
    {
        int op;
        fin >> op;

        if (op == 0)
        {
            int t, v;
            fin >> t >> v;
            update(1, 1, n, t, v);
        }
        else
        {
            int p, q;
            fin >> p >> q;
            fout << query(1, 1, n, p, q) << '\n';
        }
    }


    return 0;
}