#include <fstream>
#define NMAX 15005
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int v[NMAX],arb[4*NMAX],n,m,op,a,b,poz,val;

void build(int nod,int st,int dr)
{
  if (st==dr)
    arb[nod] = v[st];
  else
  {
    int mid=(st+dr)/2;

    build(nod*2,st,mid);
    build(nod*2+1,mid+1,dr);

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

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

        arb[nod]=arb[2*nod]+arb[2*nod+1];
    }
}
int query(int nod,int st,int dr,int start,int finish)
{
    if(start<=st && dr<=finish)
        return arb[nod];
    else
    {
        int mid=(st+dr)/2;
        if(finish<=mid)
         return query(2*nod,st,mid,start,finish);
        if(mid+1<=start)
            return query(2*nod+1,mid+1,dr,start,finish);

        return query(2*nod,st,mid,start,finish)+query(2*nod+1,mid+1,dr,start,finish);
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    build(1,1,n);
    for(int i=1;i<=m;i++)
    {
        fin>>op>>a>>b;
        if(op==0)
        {
            update(1,1,n,a,b);
        }
        else
        {
            fout<<query(1,1,n,a,b)<<"\n";
        }
    }
    return 0;
}