#include <bits/stdc++.h>
#define pb push_back
#define mod 100003
#define INF 2e9
#define ull unsigned long long
using namespace std;
ifstream in ("datorii.in");
ofstream out ("datorii.out");
int n, m, v[15005], tree[100005];
void build(int node, int left, int right){
    if(left == right){
        tree[node] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
}

void update(int node, int left, int right, int pos, int val){
    if(left == right) {
        tree[node] = tree[node] - val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
        update(2 * node, left, mid, pos, val);
    else
        update(2 * node + 1, mid + 1, right, pos, val);

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

ull query(int node, int left, int right, int x, int y){
    if(left == right)
        return tree[node];
    int mid = (left + right) / 2;
    ull a = 0, a1 = 0;
    if(x <= mid)
        a = query(2 * node, left, mid, x, y);
   if(y > mid)
        a1 = query(2 * node + 1, mid + 1, right, x, y);
    return a + a1;
}

int main() {
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        in >> v[i];

    build(1, 1, n);
    cout << '\n';
    for(int i = 1; i <= m; i++){
        int t, x, y;
        in >> t >> x >> y;
        if(t)
            out << query(1, 1, n, x, y) << '\n';
        else
            update(1, 1, n, x, y);

    }

}