#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");

int AI[45000];

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

int query(int st, int dr, int nod, int l, int r)
{
    if( st>=r || dr<=l) ///intersectia intervalelor e vida
        return 0;
    if( st>=l && dr<=r) /// [st,dr) e inclus sau egal cu [l,r)
        return AI[nod];
    int mij=st+(dr-st)/2;
    return query(st,mij,nod*2,l,r)+query(mij,dr,nod*2+1,l,r);
}

int main()
{
    int m,n;
    f>>n>>m;
    for(int i=1;i<=n;++i)
    {
        int x;
        f>>x;
        x=-x;
        update(1,n+1,1,i,x);
    }
    for(int i=1;i<=m;++i)
    {
        ///op=0 => update: s-a achitat o valoare y din suma restanta a zilei x
        ///op=1 => query: se cere suma tuturor sumelor restante din zilele x, x+1, x+2... y in momentul respectiv
        int op,x,y;
        f>>op>>x>>y;
        if(op)
            g<<query(1,n+1,1,x,y+1)<<'\n';
        else update(1,n+1,1,x,y);
    }
    return 0;
}