#include <iostream>
#include <cstdio>
#define MAXN 15050

using namespace std;

int n, m, x, pos, arbint[4*MAXN], P, Q;

void place(int nod, int st, int dr)
{
    if (st == dr) {
        arbint[nod] += x;
        return;
    }
    int mij = (st+dr)/2;
    if (pos <= mij)
        place(2*nod, st, mij);
    else
        place(2*nod+1, mij+1, dr);
    arbint[nod] = arbint[2*nod] + arbint[2*nod+1];
}

int query(int nod, int st, int dr)
{
    if (st >= P && Q >= dr)
        return arbint[nod];
    int mij = (st+dr)/2;
    if (Q <= mij)
        return query(2*nod, st, mij);
    else if (P >= mij+1)
        return query(2*nod+1, mij+1, dr);
    return query(2*nod, st, mij) + query(2*nod+1, mij+1, dr);
}

int main()
{
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);

    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &x);
        pos = i;
        place(1, 1, n);
    }
    for (int i = 1; i <= m; i++) {
        int a, b, tip;
        scanf("%d %d %d", &tip, &a, &b);
        if (tip == 0) {
            pos = a;
            x = -b;
            place(1, 1, n);
        }
        else {
            P = a, Q = b;
            printf("%d\n", query(1, 1, n));
        }
    }

    return 0;
}