#include <bits/stdc++.h>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, q, aint[60010];

inline void build(int nod, int st, int dr) {
    if(st == dr) fin >> aint[nod];
    else {
        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];
    }
}

inline void update(int nod, int poz, int st, int dr, int val) {
    if(st == dr) aint[nod] -= val;
    else {
        int mid = (st + dr) / 2;
        if(poz <= mid) update(2 * nod, poz, st, mid, val);
        else update(2 * nod + 1, poz, mid + 1, dr, val);
        aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
    }
}

inline int query(int nod, int st, int dr, int a, int b) {
    if(a <= st && dr <= b) return aint[nod];
    else {
        int mid = (st + dr) / 2, v1 = 0, v2 = 0;
        if(a <= mid) v1 = query(2 * nod, st, mid, a, b);
        if(b >= mid + 1) v2 = query(2 * nod + 1, mid + 1, dr, a, b);
        return v1 + v2;
    }
}

int main()
{
    fin >> n >> q;
    build(1, 1, n);
    while(q--) {
        int tip, a, b;
        fin >> tip >> a >> b;
        if(tip == 0) update(1, a, 1, n, b);
        else fout << query(1, 1, n, a, b) << '\n';
    }

    return 0;
}