#include <bits/stdc++.h>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,a[15005],segment_tree[35005];
void build(int node, int left, int right)
{
    if (left == right) {
        segment_tree[node] = a[left];
    } else {
        int middle = (left + right) / 2;
        build(node * 2, left, middle);
        build(node * 2 + 1, middle + 1, right);
        segment_tree[node] = segment_tree[node * 2]+segment_tree[node * 2 + 1];
    }
}
void update(int node, int left, int right, int position, int new_value)
{
    if (left == right) {
        segment_tree[node] = a[left]-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);
        segment_tree[node] = segment_tree[node * 2]+segment_tree[node * 2 + 1];
    }
}
int query(int node, int left, int right, int query_left, int query_right)
{
    if (query_left <= left and right <= query_right) {
        return segment_tree[node];
    }
    else
    {
        int middle = (left + right) / 2;
        if (query_right <= middle)
        return query(node * 2, left, middle, query_left, query_right);
        if (middle + 1 <= query_left)
        return query(node * 2 + 1, middle + 1, right, query_left, query_right);
        return query(node * 2, left, middle, query_left, query_right)+query(node * 2 + 1, middle + 1, right, query_left, query_right);
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    build(1,1,n);
    int c,poz,val,st,dr;
    for(int i=1;i<=m;i++)
    {
        fin>>c;
        if(c==0)
        {
            fin>>poz>>val;
            update(1,1,n,poz,val);
        }
        else{
            fin>>st>>dr;
            fout<<query(1,1,n,st,dr)<<"\n";
        }
    }
    return 0;
}