//am reutilizat cod de la problema arbori de intervale
#include<bits/stdc++.h>
using namespace std;

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

const int N_max= 100000;
int Arb[4*N_max+1],start,finish,n,m,bonus,com,nr,val,pozitie;

void Update(int nod, int left, int right,int pos,int val)
{
    if ( left == right )
    {
        Arb[nod] += val;
        return;
    }
    int middle = (left+right)/2;
    if ( pos <= middle )
        Update(2*nod,left,middle,pos,val);
    else
        Update(2*nod+1,middle+1,right,pos,val);
    Arb[nod] = Arb[2*nod]+Arb[2*nod+1];
}


int Query_sum(int nod, int left,int right,int limitleft,int limitright)
{

    /*if (left > right || left>limitright || right < limitleft)
        return;*/

    if(limitleft<=left && right<=limitright)
    {
       return Arb[nod];
    }

    int middle= (left+right)/2;
    int suma1=0,suma2=0;
    if(limitleft<=middle)
        suma1=Query_sum(2*nod,left,middle,limitleft,limitright);
    if(middle<limitright)
        suma2=Query_sum(2*nod+1,middle+1,right,limitleft,limitright);
    return suma1+suma2;
}


int main()
{
    int suma=0;
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        f>>nr;
        Update(1,1,n,i,nr);
    }

    for(int i=1; i<=m; i++)
    {
        f>>com;
        if(com == 1)
        {
            suma=0;
            f>>start>>finish;
            g<<Query_sum(1,1,n,start,finish)<<'\n';
        }
        else
        {
            f>>start;
            f>>finish;
            Update(1,1,n,start,-finish);
        }
    }
    return 0;
}