#include <bits/stdc++.h>
using namespace std;
ifstream in ("datorii.in");
ofstream out ("datorii.out");
int n, m, v[15001];
int aint[60001];
void build (int st, int dr, int nod)
{
    if (st == dr)
    {
        aint[nod] = v[st];
        return;
    }
    int mid = (st + dr) / 2;
    build (st, mid, nod << 1);
    build (mid + 1, dr, nod << 1 | 1);

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

    update (st, mid, nod << 1, poz, value);
    update (mid + 1, dr, nod << 1 | 1, poz ,value);

    aint[nod] = aint[nod << 1] + aint[nod << 1 | 1];
}
int query (int st, int dr, int nod, int l, int r)
{
    if (l <= st && dr <= r)
        return aint[nod];

    if (r < st || dr < l)
        return 0;

    int mid = (st + dr) / 2;
    return query(st, mid, nod << 1, l, r) + query(mid + 1, dr, nod << 1 | 1,l, r);
}
int main ()
{
    in >> n >> m;
    for (int i = 1;i<=n;++i)
        in >> v[i];
    build(1,n,1);
    for (int i = 1;i<=m;++i)
    {
        int type;
        in >> type;
        if (type == 0)
        {
            //update
            int poz, value;
            in >> poz >> value;
            update (1,n,1,poz,value);
        }
        else
        {
            int st, dr;
            in >> st >> dr;
            int rez = query(1,n,1,st,dr);
            out << rez << '\n';
        }
    }

}