#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int v[15005],n,i,a,b,m,val,x;
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,aux1=0,aux2=0;
    if(a<=st && dr<=b)return v[nod];
    else
    {
    m=(st+dr)/2;
        if(a<=m)aux1=query(2*nod,st,m,a,b);
if(b>=m+1)aux2=query(2*nod+1,m+1,dr,a,b);

        return aux1 + aux2;
    }

}


int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
    {
        f>>val;
        update(1,1,n,i,val*(-1));
    }
    while(m!=0)
    {
        f>>x>>a>>b;
        if(x==1)
        {
            g<<query(1,1,n,a,b)<<'\n';
        }
        else update(1,1,n,a,b);
m--;
    }



    return 0;
}