#include <cstdio>
#include<assert.h>
using namespace std;

int m,n,start,finish,pos,el,sum;
int h[3*15073];

void update(int nod, int left, int right)
{

    if (left==right)
    {
        h[nod]+=el;
        return;

    }


    int mid=(left+right)/2;
    if (pos<=mid) update(2*nod,left,mid);
    else update(2*nod+1,mid+1,right);

    h[nod]=h[2*nod]+h[2*nod+1];


}

void query(int nod, int left, int right)
{
    if (start<=left  && finish>=right)
        {
            sum+=h[nod];
            return;
        }

    int mid=(left+right)/2;
    if (start<=mid) query(nod*2,left,mid);
    if (mid<finish) query(nod*2+1,mid+1,right);
}



int main()
{
    int x,a,b,op;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);


    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        pos=i;el=x;
        update(1,1,n);
    }

     for(int i=0;i<m;i++)
     {
         scanf("%d%d%d",&op,&a,&b);
         if (op==1)
         {
             start=a;finish=b;
             sum=0;
             query(1,1,n);
             printf("%d\n",sum);
         }
         else
         {
             pos=a; el=-b;
             update(1,1,n);
         }
     }

     fclose(stdout);
    return 0;
}