#include <iostream>
#include<fstream>
using namespace std;

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

#define NMAX 15000

int n, Q;
int v[NMAX];
int aint[4*NMAX];
bool tip;
int a, b;

void build(int nod, int st, int dr) {
    if (st == dr) {
        aint[nod] = v[st];
        return;
    }

    int mid = (st+dr)/2;

    build(2*nod, st, mid);
    build(2*nod+1, mid+1, dr);

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

void update(int nod, int st, int dr, int pos, int val) {
    if (st == dr) {
        aint[nod] -= val;
        return;
    }

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

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

int query(int nod, int st, int dr, int L, int R) {
    if (L <= st && dr <= R) {
        return aint[nod];
    }

    int mid = (st+dr)/2;
    int ans1 = 0, ans2 = 0;
    if (L <= mid) {
        ans1 = query(nod*2, st, mid, L, R);
    }
    if (mid < R) {
        ans2 = query(nod*2+1, mid+1, dr, L, R);
    }
    return ans1+ans2;
}

int main()
{

    fin >> n >> Q;
    for (int i = 1; i<=n; i++) {
        fin >> v[i];
    }
    build(1, 1, n);

    while (Q--) {
        fin >> tip >> a >> b;
        if (tip == 0) {
            update(1, 1, n, a, b);

        } else {
            fout << query(1, 1, n, a, b) << "\n";
        }
    }


    return 0;
}