#include<fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int NMAX = 15009;

int v[NMAX],n,m;

void update(int poz,int val)
{

    int C = 0;
    while(poz <= n){
        v[poz] += val;
        while(!(poz & (1<<C))) C++;
        poz+=(1<<C);
        C++;
    }
}

int query(int poz)
{

    int C = 0 , S = 0;
    while(poz > 0){
        S += v[poz];
        while(!(poz & (1 <<C ))) C++;
        poz -= (1<<C);
        C++;
    }
    return S;
}

int main()
{

    in>>n>>m;
    int x;
    for(int i = 1 ; i <= n ; i++)
    {
        in>>x;
        update(i,x);
    }
    int tip,a,b;
    for(int i = 1 ; i <= m ; i++){
        in>>tip>>a>>b;
        if(tip == 0)
            update(a,-b);
        else
            out<<query(b)-query(a-1)<<"\n";
    }
    return 0;
}