#include<cstdio>

using namespace std;

const int nmax=15005;

int start,finish,pos,val,arb[4*nmax+66],s;

inline void update1(int node,int st,int dr)
{
    if(st==dr)
    {
        arb[node]=val;
        return;
    }
    int med=(st+dr)/2;
    if(pos<=med)
        update1(2*node,st,med);
    else
        update1(2*node+1,med+1,dr);
    arb[node]=arb[2*node]+arb[2*node+1];
}

inline void update2(int node,int st,int dr)
{
    if(st==dr)
    {
        arb[node]-=val;
        return;
    }
    int med=(st+dr)/2;
    if(pos>med)
        update2(2*node+1,med+1,dr);
    else
        update2(2*node,st,med);
    arb[node]=arb[2*node]+arb[2*node+1];
}

inline void query(int node,int st,int dr)
{
    if(start<=st&&dr<=finish)
    {
        s+=arb[node];
        return;
    }
    int med=(st+dr)/2;
    if(start<=med)
        query(2*node,st,med);
    if(finish>med)
        query(2*node+1,med+1,dr);

}

int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    int i,n,m,op,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&x);
        pos=i;
        val=x;
        update1(1,1,n);
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==0)
        {
            pos=x;
            val=y;
            update2(1,1,n);
        }
        else
        {
            s=0;
            start=x;
            finish=y;
            query(1,1,n);
            printf("%d\n",s);
        }
    }
}