#include <bits/stdc++.h>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
#define NMAX 15005
int n, m, t, x, y, a[NMAX], arbore[NMAX * 4];
void build(int node, int left, int right)
{
    if (left == right){
        arbore[node] = a[left];
    }else{
        int middle = (left + right) / 2;
        build(node * 2, left, middle);
        build(node * 2 + 1, middle + 1, right);

        arbore[node] = arbore[node * 2] + arbore[node * 2 + 1];
    }
}
void update(int node, int left, int right, int position, int new_value)
{
    if (left == right){
        arbore[node] -= new_value;
    }else {
        int middle = (left + right) / 2;
        if (position <= middle){
            update(node * 2, left, middle, position, new_value);
        }else{
            update(node * 2 + 1, middle + 1, right, position, new_value);
        }
        arbore[node] = arbore[node * 2] + arbore[node * 2 + 1];
    }
}
int query(int node, int left, int right, int q_left, int q_right)
{
    if (q_left <= left && right <= q_right){
        return arbore[node];
    }else{
        int middle = (left + right) / 2;
        if (q_right <= middle){
            return query(node * 2, left, middle, q_left, q_right);
        }
        if (middle + 1 <= q_left){
            return query(node * 2 + 1, middle + 1, right, q_left, q_right);
        }

        return query(node*2, left, middle, q_left, q_right) +
                   query(node*2+1, middle+1, right, q_left, q_right);
    }
}
int main() {
    fin >> n >> m;
    for (int i=1;i<=n;i++){
        fin >> a[i];
    }
    build(1, 1, n);
    for (int k=1;k<=m;k++){
        fin >> t >> x >> y;
        if (t == 0){
            update(1, 1, n, x, y);
        }else {
            fout << query(1, 1, n, x, y) << '\n';
        }
    }
    return 0;
}