#include <stdio.h>
#include <vector>
#define NMax 15005
#define minim(a,b)((a>b)?b:a)
using namespace std;
std::vector<int> a;
int n,m,x,y,z,poz,val,suma,arb[4*NMax];
void _update(int nod,int left,int right)
{
    if(left==right)
    {
        arb[nod] = val;
        return;
    }

    int mij = ((left+right)>>1);
    if( poz <= mij )_update((nod<<1),left,mij);
    else _update(((nod<<1)|1),mij+1,right);
    arb[nod] =arb[(nod<<1)] + arb[((nod<<1)|1)] ;
}
void _query(int nod,int left,int right)
{
    if( y <= left && right <= z )
    {
        suma += arb[nod];
        return;
    }

    int mij = ((left+right)>>1);
    if( y <= mij )_query((nod<<1),left,mij);
    if( mij < z )_query(((nod<<1)|1),mij+1,right);
}
int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d %d",&n,&m);
    a.push_back(0);
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&x);
        a.push_back(x);
        poz = i;val = x;
        _update(1,1,n);
    }
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d %d",&x,&y,&z);
        if(x==0)
        {
            a[y] = a[y] - z;
            poz = y;val = a[y];
            _update(1,1,n);
        }
        else
        {
            suma = 0;
            _query(1,1,n);
            printf("%d\n",suma);
        }
    }
    return 0;
}