#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
const int NMAX = 15e3;
int n, v[NMAX + 2], aint[4 * NMAX + 2], m, x, y, c, ans;

void build(int node, int st, int dr) {
    if (st == dr) fin >> aint[node];
    else {
        int mid = (st + dr) / 2;
        build(2 * node, st, mid);
        build(2 * node + 1, mid + 1, dr);
        aint[node] = aint[node * 2] + aint[2 * node + 1];
    }
}

void query (int node, int st, int dr, int x, int y) {
    if (x <= st && dr <= y) ans += aint[node];
    else {
        int mid = (st + dr) / 2;
        if (mid >= x) query(2 * node, st, mid, x, y);
        if (mid < y) query(2 * node + 1, mid + 1, dr, x, y);
    }
}

void update(int node, int st, int dr, int p, int x) {
    if (st == dr) {
        aint[node] -= x;
    }
    else {
        int mid = (st + dr) / 2;
        if (p <= mid) update(2 * node, st, mid, p, x);
        if (p > mid) update(2 * node + 1, mid + 1, dr, p, x);
        aint[node] = aint[node * 2] + aint[node * 2 + 1];
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fin >> n >> m;
    build(1, 1, n);
    while (m--) {
        fin >> c >> x >> y;
        if (c) {
            ans = 0;
            query(1, 1, n, x, y);
            fout << ans << '\n';
        }
        else {
            update(1, 1, n, x, y);
        }
    }
    return 0;
}