#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");

const int NMAX=100003;

int n,m,sumarb[4*NMAX+100];
int sum,poz,valoare,start,stop;

void update(int nod,int stanga, int dreapta)
{
    if(stanga==dreapta)
    {
        sumarb[nod]+=valoare;
        return;
    }
    int m=(stanga+dreapta)/2;
    if(poz<=m)
        update(2*nod,stanga,m);
    else
        update(2*nod+1,m+1,dreapta);
    sumarb[nod]=sumarb[2*nod]+sumarb[2*nod+1];
}

int query(int nod, int stanga, int dreapta)
{
    if(start<=stanga && dreapta<=stop)
    {
    return sumarb[nod];
    }
    int sum1=0,sum2=0;
    int mij=(stanga+dreapta)/2;
    if(start<=mij) sum1=query(2*nod,stanga,mij);
    if(mij<stop) sum2=query(2*nod+1,mij+1,dreapta);
    return sum1+sum2;
}
int main()
{   int x,a,b;
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        poz=i, valoare=x;
        update(1,1,n);
    }
    for(int i=1;i<=m;i++)
    {
        f>>x>>a>>b;
        if(x==1)
        {
            start=a;stop=b;
            g<<query(1,1,n)<<'\n';

        }else{
        poz=a;valoare=-b;
        update(1,1,n);
        }
    }
    return 0;
}