#include <iostream>
#include <fstream>
using namespace std;
int arb[60055], i, m, n, val, pos, start, finish, sum, p, x, y;
void update(int nod, int left, int right)
{
    if(left==right)
    {
        arb[nod]=val;
        return;
    }
    int mij=(left+right)/2;
    if(pos<=mij) update(2*nod, left, mij);
    else update(2*nod+1, mij+1, right);
    arb[nod]=arb[2*nod]+arb[2*nod+1];
}
void scad(int nod, int left, int right)
{
    if(left==right)
    {
        arb[nod]-=val;
        return;
    }
    int mij=(left+right)/2;

    if(pos<=mij) scad(2*nod, left, mij);
    else scad(2*nod+1, mij+1, right);

    arb[nod]=arb[2*nod]+arb[2*nod+1];
}
void query(int nod, int left, int right)
{
    if(left>=start&&right<=finish)
    {
        sum+=arb[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()
{
    ifstream fin("datorii.in");
    ofstream fout("datorii.out");
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>val;
        pos=i;
        update(1, 1, n);
    }
    for(i=1; i<=m; i++)
    {
        fin>>p>>x>>y;
        if(p==0)
        {
            pos=x;
            val=y;
            scad(1, 1, n);
        }
        else if(p==1)
        {
            sum=0;
            start=x;
            finish=y;
            query(1, 1, n);
            fout<<sum<<"\n";
        }
    }
    return 0;
}