#include <stdio.h>
#define max 15010
#define mid ((st+dr)/2)
#define left (2*nod)
#define right (2*nod+1)
int arb[2*max+100],i,j,n,m,x,val,pos;
void update(int nod,int st,int dr)
{
    if(st==dr) { arb[nod]+=val; return; }

    if(pos<=mid) update(left,st,mid);
    if(pos>mid)  update(right,mid+1,dr);

    arb[nod]=arb[left]+arb[right];
}
int query(int nod,int st,int dr)
{
    if(i<=st && dr<=j) return arb[nod];

    if(i<=mid) val+=query(left,st,mid);
    if(j>mid)  val+=query(right,mid+1,dr);

    return val;
}
int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=n; i++)
    {
        pos=i; scanf("%d",&val);
        update(1,1,n);
    }
    for(; m>0; m--)
    {
        scanf("%d",&x);
        if(x)
        {
            scanf("%d%d",&i,&j);
            val=0;
            printf("%d\n",query(1,1,n));
        }
        else
        {
            scanf("%d%d",&pos,&val);
            val=-val;
            update(1,1,n);
        }
    }
    return 0;
}