#include <fstream>

using namespace std;

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

int aint[60020], v[15005];
int n, m, op;

int left_son(int nod)
{
    return 2*nod;
}

int right_son (int nod)
{
    return 2*nod+1;
}

void init (int nod, int st, int dr)
{
    if(st==dr)
    {
        aint[nod]=v[st];
        return;
    }
    int mij = (st+dr)/2;
    init(left_son(nod), st, mij);
    init(right_son(nod), mij+1, dr);
    aint[nod]=aint[left_son(nod)] + aint[right_son(nod)];
}

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

int query(int nod, int st, int dr, int range_st, int range_dr)
{
    if(range_st <= st && dr <= range_dr)
        return aint[nod];
    int mij = (st+dr)/2;
    int suma=0;
    if(range_st <= mij)
        suma += query(left_son(nod), st, mij, range_st, range_dr);
    if(mij+1 <= range_dr)
        suma += query(right_son(nod), mij+1, dr, range_st, range_dr);
    return suma;
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    init(1, 1, n);
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>op>>x>>y;
        if(op==0) //update
            update(1, 1, n, x, y);
        if(op==1) //query
        {
            int ans = query(1, 1, n, x, y);
            fout<<ans<<'\n';
        }
    }
    return 0;
}