#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>

#pragma warning "da 100% din tine. :)"
#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SIZE 3000
#define NR 105
#define N 11
#define INF 10000

using namespace std;

int elem[15001];
int sum[15001];
int m, n;

void compute(int a) {
    for (int i = a; i <= n; ++i)
        sum[i] = sum[i - 1] + elem[i];
}

int main() {
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    clock_t tStart = clock();
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> elem[i];
    int cer, a, b;
    int rema = 100001, remb = 0;
    compute(1);
    int lastcer = 0;
    while (m--) {
        cin >> cer >> a >> b;
        if (cer == 0) {
            elem[a] -= b;
            lastcer = 0;
            compute(a);
        } else {
            cout << sum[b] - sum[a - 1] << nl;
            lastcer = 1;
        }
    }
//    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}