#include <fstream>

using namespace std;

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

const int NMAX = 15001;

int n, m;
int aint[4 * NMAX];
int a[NMAX];

inline void read();
void build(int node, int lo, int hi);
void update(int node, int lo, int hi, const int& val, const int& pos);
inline void solve();
void query(int node, int lo, int hi, int a, int b, int& ans);

int main()
{
    read();
    solve();

    fin.close();
    fout.close();
    return 0;
}

inline void read() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> a[i];
    build(1, 1, n);
}

inline void build(int node, int lo, int hi) {
    if (lo == hi) {
        aint[node] = a[lo];
        return;
    }

    int mid = (lo + hi) / 2;
    build(2 * node, lo, mid);
    build(2 * node + 1, mid + 1, hi);

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

void update(int node, int lo, int hi, const int& val, const int& pos) {
    if (lo == hi) {
        aint[node] = val;
        a[pos] = val;
        return;
    }

    int mid = (lo + hi) / 2;
    if (pos <= mid)
        update(2 * node, lo, mid, val, pos);
    else
        update(2 * node + 1, mid + 1, hi, val, pos);

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

inline void solve() {
    int op, x, y, sum;


    while (m--) {
        fin >> op >> x >> y;
        if (op == 0) {
            update(1, 1, n, a[x] - y, x);
        }
        else {
            sum = 0;
            query(1, 1, n, x, y, sum);
            fout << sum << '\n';
        }
    }
}

void query(int node, int lo, int hi, int a, int b, int& ans) {
    if (a <= lo && hi <= b) {
        ans += aint[node];
        return;
    }

    int mid = (lo + hi) / 2;
    if (a <= mid)
        query(2 * node, lo, mid, a, b, ans);
    if (mid < b)
        query(2 * node + 1, mid + 1, hi, a, b, ans);
}