#include <cstdio>
#include <cstdlib>

using namespace std;

int arb[15010];
char * buffer;
inline int max(int a,int b)
{
    if(a>b)
        return a;
    return b;
}

void update(int nod,int st,int dr,int p,int v)
{

    if(st == dr)
        arb[nod] += v;
    else
    {
        arb[nod] += v;
        int mij = (st+dr)/2;

        if(p<=mij)
            update(nod *2,st,mij,p,v);
        else
            update(nod *2 +1,mij+1,dr,p,v);
    }
}


int query(int nod,int st,int dr,int a,int b)
{
    if(a <= st && dr <= b)
        return arb[nod];
    int mij = (st+dr)/2;
    int s1=0,s2=0;
    if(a <= mij)
        s1 = query(nod *2,st,mij,a,b);
    if(b > mij)
        s2 = query(nod*2+1,mij+1,dr,a,b);
    return s1+s2;
}

void read(int & a)
{
    a ^= a;
    while(*buffer < '0' || *buffer > '9')
        ++buffer;
    while(*buffer >= '0' && *buffer <= '9')
        a = a * 10 + *(buffer++) - '0';
}

int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    int n,m;
    int size;
    fseek(stdin,0,SEEK_END);
    size = ftell(stdin);
    rewind(stdin);
    buffer = (char *) malloc(size);
    fread(buffer,1,size,stdin);
    read(n);
    read(m);
    int i;
    int tip;
    int a,b;
    for(i=1;i<=n;++i)
    {
        read(tip);
        update(1,1,n,i,tip);
    }
    while(m--)
    {
        read(tip);
        read(a);
        read(b);
        if(tip)
            printf("%d\n",query(1,1,n,a,b));
        else
            update(1,1,n,a,-b);
    }
    return 0;
}