#include <bits/stdc++.h>
#define nl '\n'
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int N = 15000;
int values[N + 2], seg_tree[4 * N + 2];
void build(int node, int l, int r)
{
    if (l == r) {
        seg_tree[node] = values[l];
    }
    else {
        int middle = (l + r) / 2;

        build(node * 2, l, middle);
        build(node * 2 + 1, middle + 1, r);

        seg_tree[node] = seg_tree[node * 2] + seg_tree[node * 2 + 1];
    }
}

void update(int node, int l, int r, int position, int new_value)
{
    if (l == r) {
        seg_tree[node] -= new_value;
    }
    else {
        int middle = (l + r) / 2;

        if (position <= middle)
            update(node * 2, l, middle, position, new_value);
        else
            update(node * 2 + 1, middle + 1, r, position, new_value);

        seg_tree[node] = seg_tree[node * 2] + seg_tree[node * 2 + 1];
    }
}

int query(int node, int l, int r, int ql, int qr)
{
    if (ql <= l and r <= qr) {
        return seg_tree[node];
    }
    else {
        int middle = (l + r) / 2;

        if (qr <= middle)
            return query(node * 2, l, middle, ql, qr);
        if (middle + 1 <= ql)
            return query(node * 2 + 1, middle + 1, r, ql, qr);

        return query(node * 2, l, middle, ql, qr) + query(node * 2 + 1, middle + 1, r, ql, qr);
    }
}
int main() {
    int n, q;
    in >> n >> q;

    for (int i = 1; i <= n; ++i)
        in >> values[i];
    build(1, 1, n);

    for (int i = 1; i <= q; i++) {
        int cer;
        in >> cer;
        if (cer == 1) {
            int st, dr;
            in >> st >> dr;
            out << query(1, 1, n, st, dr) << nl;
        }
        else {
            int node, val;
            in >> node >> val;
            update(1, 1, n, node, val);
        }
    }
    return 0;
}