#include <fstream>
#include <cmath>

using namespace std;
const int NMAX = 15002;

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

int v[NMAX];
int bucket[NMAX], block;
int b[125];

void removee(int pos, int nr) {
    v[pos] -= nr;
    b[bucket[pos]] -= nr;
}
int query(int l, int r) {
    int sum = 0;
    int start = bucket[l], fin = bucket[r];
    if(bucket[l] == bucket[r]) {
        for(int i = l; i <= r; i++)
            sum += v[i];
        return sum;
    }
    for(int i = start + 1; i < fin; i++)
        sum += b[i];
    while(bucket[l] == start) {
        sum += v[l];
        l++;
    }
    while(bucket[r] == fin) {
        sum += v[r];
        r--;
    }
    return sum;
}

int main()
{
    int n, m;
    cin >> n >> m;
    block = sqrt(n);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
        bucket[i] = (i - 1) / block + 1;
        b[bucket[i]] += v[i];
    }
    while(m--) {
        bool ok;
        int pos, nr, st, dr;
        cin >> ok;
        if(!ok) {
            cin >> pos >> nr;
            removee(pos, nr);
        }
        else {
            cin >> st >> dr;
            cout << query(st, dr) << '\n';
        }
    }
    return 0;
}