//#include <iostream>
#include <fstream>
#include<vector>
using namespace std;


ifstream cin("datorii.in");
ofstream cout("datorii.out");

vector<int> st;

void update(int node, int from, int to, int pos, int val) {
    if (from == to) {
        st[node] += val;
        return;
    }

    int mid = (from + to) / 2;
    if (pos <= mid) {
        update(node * 2, from, mid, pos, val);
    }
    else {
        update(node * 2+1, mid+1, to, pos, val);
    }

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

int query(int node, int from, int to, int ql, int qr) {
    if (ql <= from && to <= qr)
        return st[node];

    int mid = (from + to) / 2;
    int sum = 0;

    if (mid >= ql) {
        sum += query(node * 2, from, mid, ql, qr);
    }
    if (mid+1 <= qr) {
        sum += query(node * 2 + 1, mid + 1, to, ql, qr);
    }
    return sum;
}


int main()
{
    int n, i,  m,a,b,c;

    cin >> n >> m;
    st.resize(4*n + 5);

    for (i = 1; i <= n; i++) {
        cin >> a;
        update(1, 1, n, i, a);
    }

    for (i = 0; i < m; i++) {
        cin >> a >> b >> c;
        if (a == 0) {
            update(1, 1, n, b, -c);

        }
        else {
            cout << query(1, 1, n, b, c) << "\n";
        }
    }


    return 0;
}