#include <stdio.h>
#include <string.h>

#define MAXN 15000
#define MAXM 100000

int n, m, a[MAXN + 5], b[MAXN + 5];

void build(int p, int l, int r) {
if (l == r) {
b[p] = a[l];
return;
}
int mid = (l + r) / 2;
build(p * 2, l, mid);
build(p * 2 + 1, mid + 1, r);
b[p] = b[p * 2] + b[p * 2 + 1];
}

void update(int p, int l, int r, int x, int k) {
if (l == r) {
b[p] = k;
return;
}
int mid = (l + r) / 2;
if (x <= mid)
update(p * 2, l, mid, x, k);
else
update(p * 2 + 1, mid + 1, r, x, k);
b[p] = b[p * 2] + b[p * 2 + 1];
}

int query(int p, int l, int r, int x, int y) {
if (x <= l && r <= y)
return b[p];
int mid = (l + r) / 2, s = 0;
if (x <= mid)
s += query(p * 2, l, mid, x, y);
if (y > mid)
s += query(p * 2 + 1, mid + 1, r, x, y);
return s;
}

int main() {

    FILE *in=fopen("datorii.in", "r");
    FILE *out=fopen("datorii.out", "w");
fscanf(in, "%d %d\n", &n, &m);
for (int i = 1; i <= n; i++)
fscanf(in, "%d", &a[i]);
build(1, 1, n);
while (m--) {
int t, p, q;
fscanf(in, "%d %d %d", &t, &p, &q);
if (!t)
update(1, 1, n, p, q);
else
fprintf(out, "%d\n", query(1, 1, n, p, q));
}
fclose(in);
fclose(out);
return 0;
}