#include <iostream>
#define Nmax 300005
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int pos,val,x,a,b,n,m,tree[Nmax],start,finish,suma,ok=0;
void Update(int nod,int left,int right)
{
    if(left==right)
    {   if(!ok)tree[nod]=val;
        else {tree[nod]-=val;
        }
        return;
    }
    int mij=(left+right)/2;
    if(mij>=pos)Update(2*nod,left,mij);
    else Update(2*nod+1,mij+1,right);
    tree[nod]=tree[2*nod]+tree[2*nod+1];
}
void Query(int nod,int left,int right)
{
    if(start<=left && finish>=right)
    {
        suma+=tree[nod];
        return;
    }
    int mij=(left+right)/2;
    if(mij>=start)Query(2*nod,left,mij);
    if(mij<finish)Query(2*nod+1,mij+1,right);
}
int main()
{
    fin>>n>>m;
    int i;
    for(i=1; i<=n; ++i)
    {
        fin>>val;
        pos=i;
        Update(1,1,n);
    }
    ok=true;
    for(i=1; i<=m; ++i)
    {
        fin>>x>>a>>b;
        if(x==0)
        {
            pos=a;
            val=b;
            Update(1,1,n);
        }
        else
        {
            start=a;
            finish=b;
            suma=0;
            Query(1,1,n);
            fout<<suma<<'\n';
        }
    }
    return 0;
}