//Datorii

#include <fstream>

using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

#define MAXN 15001

int N, M;
int A[MAXN];
long long ArbInt[MAXN*4];

void update(int nod, int st, int dr, int poz, int val) {
    if(st == dr) {
        ArbInt[nod] = val;
        return;
    }

    int mid = (st + dr)/2;
    if(poz <= mid)
        update(2*nod, st, mid, poz, val);
    else
        update(2*nod + 1, mid + 1, dr, poz, val);

    ArbInt[nod] = ArbInt[2*nod] + ArbInt[2*nod + 1];
}

int query(int nod, int st, int dr, int a, int b) {
    if(a <= st && dr <= b) // [st,dr] continut in [a,b]
        return ArbInt[nod];

    int mid = (st + dr)/2;
    int val1 = 0, val2 = 0;

    if(a <= mid)
        val1 = query(2*nod, st, mid, a, b);
    if(mid < b)
        val2 = query(2*nod + 1, mid + 1, dr, a, b);

    return val1 + val2;
}

int main()
{
    int i;
    int op, x, y;

    fin>>N>>M;
    for(i = 1 ; i <= N ; i++) {
        fin>>A[i];
        update(1, 1, N, i, A[i]);
    }

    for(i = 1 ; i <= M ; i++) {
        fin>>op>>x>>y;

        if(op == 0) {
            A[x] -= y;
            update(1, 1, N, x, A[x]);
        }
        else {
            fout<<query(1, 1, N, x, y)<<"\n";
        }
    }
    fin.close();
    fout.close();

    return 0;
}