#include<iostream>
#include<fstream>
#define NMAX 15005
using namespace std;

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

int n,m;
int v[NMAX];
int arb[4*NMAX];

void Update(int st, int dr, int idx, int pos, int val)
{
    if(st == dr)
    {
        arb[idx] = arb[idx] + val;
        return;
    }
    int mij = (st+dr) / 2;
    if(mij<pos)
        Update(mij+1,dr,(idx*2)+1, pos, val);
    else
        Update(st,mij,idx*2,pos,val);
    arb[idx] = arb[idx*2] + arb[(idx*2)+1];
}
int Query(int st,int dr, int arbst, int arbdr, int idx)
{
    if(arbst>dr || arbdr<st)
        return 0;
    if(arbst>=st && arbdr<=dr)
        return arb[idx];
    int mij = (arbst+arbdr) / 2;
    int leftval = Query(st,dr,arbst,mij,idx*2);
    int rightval = Query(st,dr,mij+1,arbdr,(idx*2)+1);
    return leftval+rightval;
}

void Citire()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>v[i];
        Update(1,n,1,i,v[i]);
    }
}

void Solve()
{
    for(int i=1;i<=m;i++)
    {
        int c;
        int a,b;
        f>>c>>a>>b;
        if(c==0)
        {
            Update(1,n,1,a,-b);
        }
        else
            g<<Query(a,b,1,n,1)<<"\n";
    }
}

int main()
{
    Citire();
    Solve();
}