#include <bits/stdc++.h>

using namespace std;

ifstream f("datorii.in");
ofstream g("datorii.out");

int v[(1<<19)];


void update(int nod,int st,int dr,int pos,int val)
{
    if(st==dr)v[nod] = v[nod] - val;
    else
    {
        int m=(st+dr)/2;
        if(pos<=m)update(2*nod,st,m,pos,val);
        else update(2*nod+1,m+1,dr,pos,val);

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


int query(int nod,int st,int dr,int a,int b)
{

    int m,x1=0,x2=0;
    if(a<=st && dr<=b)return v[nod];
    else
    {
        m=(st+dr)/2;
        if(a<=m)x1=query(2*nod,st,m,a,b);
        if(b>=m+1)x2=query(2*nod+1,m+1,dr,a,b);

        return x1 + x2;
    }

}



int n,i,a,b,m,val,x;

int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>val;
        update(1,1,n,i,(-1) * val);
    }
    //for ( i = 1; i <= 2 * n; i++ )
        //cout << v[i] << " ";
    for(i=1;i<=m;i++)
    {
        f>>x>>a>>b;
        if(x==0)
        {
            update(1,1,n,a,b);
        }
        else g<<query(1,1,n,a,b)<<'\n';
    }
    //for ( i = 1; i <= 2 * n; i++ )
        //cout << v[i] << " ";


    return 0;
}