#include <bits/stdc++.h>
using namespace std;

ifstream f("datorii.in");
ofstream g("datorii.out");
#define cin f
#define cout g

int aInt[500000], n, m, x, op, y;

void update(int nod, int left, int right, int poz, int val, bool citire) {
    if(left == right) {
        aInt[nod] = (citire) ? val : aInt[nod] - val;
        return;
    }
    int mid = (left + right) / 2;
    if(poz <= mid) update(nod * 2, left, mid, poz, val, citire);
    else update(nod * 2 + 1, mid + 1, right, poz, val, citire);
    aInt[nod] = aInt[2 * nod] + aInt[2 * nod + 1];
}

int query(int nod, int left, int right, int a, int b) {
    if(left >= a && b >= right) return aInt[nod];
    int mid = (left + right) / 2, v1 = 0, v2 = 0;
    if(a <= mid)
        v1 = query(nod * 2, left, mid, a, b);
    if(b > mid)
        v2 = query(nod * 2 + 1, mid + 1, right, a, b);
    return v1 + v2;
}

int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> x;
        update(1, 1, n, i, x, true);
    }
    for(int i = 0; i < m; i++) {
        cin >> op >> x >> y;
        if(op == 1)
            cout << query(1, 1, n, x, y) << "\n";
        else 
            update(1, 1, n, x, y, false);
    }
}