#include <fstream>
#include <vector>

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


int tree[1000001];
struct segtree
{
    void setare(int i, int v, int node, int lx, int rx)
    {
        if(rx - lx == 1)
        {
            tree[node] = v;
            return ;
        }
        if((lx + rx) / 2 > i)
            setare(i, v, 2 * node + 1, lx, (lx + rx) / 2);
        else
            setare(i, v, 2 * node + 2, (lx + rx) / 2, rx);
        tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
    }
    void setare(int i, int v, int intersize)
    {
        setare(i, v, 0, 0, intersize);
    }
    int query(int l, int r, int node, int lx, int rx)
    {
        if(rx <= l || lx >= r)
            return 0;
        if(l <= lx && rx <= r)
            return tree[node];

        int mij= (lx + rx) / 2;
        int s1 = 0, s2 = 0;
        if(mij >= l)
            s1 += query(l, r, 2 * node + 1, lx, mij);
        if(mij <= r)
            s2 += query(l, r, 2 * node + 2, mij, rx);
        return s1 + s2;
    }
    int query(int l, int r,  int intersize)
    {
        return query(l, r, 0, 0, intersize);
    }

};



int main()
{
    int n, i, q;

    fin >> n >> q;

    segtree sg;
    vector <int> v(n);
    for(i = 0; i < n; i++)
        fin >> v[i], sg.setare(i, v[i], n);

    for(i = 0; i < q; i++)
    {
        int tip, a, b;
        fin >> tip >> a >> b;
        if(tip == 0)
        {
            a--;
            sg.setare(a, v[a] - b, n);
        }
        else
        {
            a--;
            fout << sg.query(a, b, n) << '\n';
        }
    }


    return 0;
}