#include <bits/stdc++.h>
using namespace std;
     
ifstream in("datorii.in");
ofstream out("datorii.out");

const int NMax = 15e3 + 5;

int a[NMax], aInt[4 * NMax];

void build(int currentNode, int l, int r) {
    if(l == r) {
        aInt[currentNode] = a[l];
        return;
    }

    int mid = (l + r) / 2;
    build(2 * currentNode, l, mid);
    build(2 * currentNode + 1, mid + 1, r);
    aInt[currentNode] = aInt[2 * currentNode] + aInt[2 * currentNode + 1];
}

int query(int currentNode, int l, int r, int a, int b) {
    if(a <= l && b >= r) {
        return aInt[currentNode];
    }
    
    int mid = (l + r) / 2;
    if(a > r || b < l) {
        return 0;
    }

    return query(2 * currentNode, l , mid, a, b) + query(2 * currentNode + 1, mid + 1, r, a, b);
}

void update(int currentNode, int l, int r, int targetPoz, int value) {
    if(l == r) {
        aInt[currentNode] -= value;
        return;
    }

    int mid = (l + r) / 2;
    if(targetPoz <= mid) {
        update(2 * currentNode, l, mid, targetPoz, value);
    } else {
        update(2 * currentNode + 1, mid + 1, r, targetPoz, value);
    }

    aInt[currentNode] = aInt[2 * currentNode] + aInt[2 * currentNode + 1];
}
 
int main() {
    ios::sync_with_stdio(false); in.tie(0); out.tie(0);
   
    int n, m; in >> n >> m;

    for(int i = 1; i <= n; ++i) {
        in >> a[i];
    }

    build(1, 1, n);

    for(int i = 1; i <= m; ++i) {
        int x, a, b; in >> x >> a >> b;

        if(x == 1) {
            out << query(1, 1, n, a, b) << '\n';
        } else {
            update(1, 1, n, a, b);
        }
    }
      
    in.close(); out.close();
     
    return 0;
}