#include <cstdio>

#define TSize 32769
#define buffSize 16384

using namespace std;

char buff[buffSize];

int T[TSize];
int sol,ind;

bool ok=true;

inline int read(int &x)
{
    if(ok)
    {
        ok=false;
        fread(buff,1,buffSize,stdin);
        ind=0;
    }

    for(x=0;buff[ind]>='0'&&buff[ind]<='9';)
    {
        x*=10;
        x+=buff[ind]-'0';

        if(++ind==buffSize)
        {
            fread(buff,1,buffSize,stdin);
            ind=0;
        }
    }

    for(;buff[ind]<'0'||buff[ind]>'9';)
        if(++ind==buffSize)
        {
            fread(buff,1,buffSize,stdin);
            ind=0;
        }
}

inline void update(int nod,int L,int R,int pos,int val)
{
    if(L==pos&&pos==R)
    {
        T[nod]+=val;
        return;
    }

    int M=(L+R)>>1;

    if(pos<=M) update(nod<<1,L,M,pos,val);
    else update((nod<<1)+1,M+1,R,pos,val);

    T[nod]+=val;
}

inline void query(int nod,int L,int R,int a,int b)
{
    if(a<=L&&R<=b)
    {
        sol+=T[nod];
        return;
    }

    int M=(L+R)>>1;

    if(a<=M) query(nod<<1,L,M,a,b);
    if(b>M) query((nod<<1)+1,M+1,R,a,b);
}

int main()
{
    int M,N,x,a,b;

    freopen("datorii.in","r",stdin);

    read(N);
    read(M);
    for(int i=1;i<=N;++i)
    {
        read(x);
        update(1,1,N,i,x);
    }

    freopen("datorii.out","w",stdout);

    for(;M--;)
    {
        read(x);
        read(a);
        read(b);
        if(x==0) update(1,1,N,a,-b);
        else
        {
            sol=0;
            query(1,1,N,a,b);
            printf("%d\n",sol);
        }
    }

    return 0;
}