#include<iostream>

using namespace std;

#define NMAX 15001

int sarb[4*NMAX];
int sm;
int sc=0;

void update(int n,int l,int r,int i,int v)
{
    if(l==r)
    {
        if(sc)sarb[n]-=v;
        else sarb[n]+=v;
        return;
    }
    int m;
    m=(l+r)/2;
    if(i<=m) update(2*n,l,m,i,v);
    else update(2*n+1,m+1,r,i,v);
    sarb[n]=sarb[2*n]+sarb[2*n+1];
}

void query(int n,int l,int r,int s,int d)
{
    if(s<=l && r<=d)
    {
        sm+=sarb[n];
        return;
    }
    int m;
    m=(l+r)/2;
    if(s<=m) query(2*n,l,m,s,d);
    if(m<d) query(2*n+1,m+1,r,s,d);
}

int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    int i,n,m;
    int a,b;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a);
        update(1,1,n,i,a);
    }
    sc=1;
   for(i=1;i<=m;i++)
    {
        int op;
        scanf("%d%d%d",&op,&a,&b);

        if(!op)
        {
            update(1,1,n,a,b);
        }
        else
        {
            sm=0;
            query(1,1,n,a,b);
            printf("%d\n",sm);
        }
    }
    return 0;
}