#include <bits/stdc++.h>
using namespace std;

int ai[60005];

int n,m;

void update(int nod, int a, int b, int poz, int val)
{
    if(a==b)
    {
        ai[nod]+=val;
        return ;
    }
    int mij=(a+b)>>1;
    if(poz<=mij)update(nod*2,a,mij,poz,val);
    else update(nod*2+1,mij+1,b,poz,val);
    ai[nod]=ai[2*nod]+ai[2*nod+1];
}

int query(int nod, int a, int b, int qa, int qb)
{
    if(qa<=a && b<=qb)
        return ai[nod];
    int ans1,ans2,mij;
    ans1=ans2=0;
    mij=(a+b)>>1;
    if(qa<=mij)ans1=query(nod*2,a,mij,qa,qb);
    if(qb>mij)ans2=query(nod*2+1,mij+1,b,qa,qb);
    return ans1+ans2;

}

const int bsize = (1<<16)+1;

char buffer[bsize];

int p = 0;

void ReadInt(int &nr)
{
    nr = 0;
    while(!isdigit(buffer[p]))
    {
        if(p==bize-1)
        {
            fread(buffer,1,bsize,stdin);
            p = 0;
        }
        else
        {
            ++p;
        }
    }
    while(isdigit(buffer[p]))
    {
        nr = nr*10 + buffer[p] - '0';
        if(p==bsize-1)
        {
            fread(buffer,1,bsize,stdin);
            p = 0;
        }
        else
        {
            ++p;
        }
    }
}

int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    ReadInt(n);
    ReadInt(m);
    for(int i=1; i<=n; ++i)
    {
        int x;
        ReadInt(x);
        update(1,1,n,i,x);
    }
    for(int i=1; i<=m; ++i)
    {
        ReadInt(tip);
        ReadInt(a);
        ReadInt(b);
        if(tip==0)update(1,1,n,a,-b);
        else g<<query(1,1,n,a,b)<<'\n';
    }
    return 0;
}