#include <fstream>

using namespace std;

#define dim 15000

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

int n,m,i,x,val,pos,SumArb[4*dim+100],ans;
int start,finish,a,b,c;

void update(int nod,int left,int right)
{
    if(left==right)
    {
        SumArb[nod]+=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)update(2*nod,left,mid);
    else update(2*nod+1,mid+1,right);

    SumArb[nod]=SumArb[nod*2]+SumArb[nod*2+1];
}

void query(int nod,int left,int right)
{
    if(start<=left&&right<=finish)
    {
        ans+=SumArb[nod];
        return;
    }
    if(left!=right)
    {
    int mid=(left+right)/2;
    if(start<=mid)query(nod*2,left,mid);
    if(mid<=finish)query(nod*2+1,mid+1,right);
    }
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>x;
        val=x;pos=i;
        update(1,1,n);
    }
    for(i=1;i<=m;i++)
    {
        fin>>c>>a>>b;
        if(c==0)
        {
            pos=a;
            val=-b;
            update(1,1,n);
        }
        else
        {
            ans=0;
            start=a;
            finish=b;
            query(1,1,n);
            fout<<ans<<'\n';
        }
    }
    return 0;
}