#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 15005
#define nst (nod<<1)
#define ndr (nst+1)
int n,m,A[MAXN],arbint[MAXN<<2],suma;
void update(int nod,int st,int dr,int poz,int val)
{
    if (st==dr)
    {
        arbint[nod]+=val;
        return;
    }
    int mid=(st+dr)>>1;
    if (poz<=mid) update(nst,st,mid,poz,val);
    else update(ndr,mid+1,dr,poz,val);
    arbint[nod]=arbint[nst]+arbint[ndr];
}
void query(int nod,int st,int dr,int a,int b)
{
    if (a<=st && dr<=b)
    {
        suma+=arbint[nod];
        return;
    }
    int mid=(st+dr)>>1;
    if (a<=mid) query(nst,st,mid,a,b);
    if (b>mid) query(ndr,mid+1,dr,a,b);
}
int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++) scanf("%d",&A[i]),update(1,1,n,i,A[i]);
    int type,a,b;
    while (m--)
    {
        scanf("%d %d %d",&type,&a,&b);
        if (type==0) update(1,1,n,a,-b);
        else
        {
            suma=0; query(1,1,n,a,b);
            printf("%d\n",suma);
        }
    }
    return 0;
}