#include <fstream>
#include <vector>

std::ifstream in("datorii.in");
std::ofstream out("datorii.out");

int n, m;
std::vector<int> v;
std::vector<int> w;

void build(int node, int st, int dr){
    if(st == dr){
        w[node] = v[st];
        return;
    } 
    int mid = (st + dr) / 2;
    build(2*node, st, mid);
    build(2*node+1, mid+1, dr);
    w[node] = w[2*node] + w[2*node+1];
}

int query(int node, int st, int dr, int x, int y){
    if(x <= st && dr <= y) return w[node];
    if(y < st || x > dr) return 0;
    
    int mid = (st + dr) / 2;
    int r1 = query(2*node, st, mid, x, y);
    int r2 = query(2*node+1, mid+1, dr, x, y);
    return r1+r2;
}

void update(int node, int st, int dr, int T, int V){
    if(st == dr){
        w[node] -= V;
        return;
    }

    int mid = (st + dr) / 2;
    if(T <= mid) update(2*node, st, mid, T, V);
    else update(2*node+1, mid+1, dr, T, V);
    w[node] = w[2*node] + w[2*node+1];
}

int main(){
    in >> n >> m;
    v.resize(n+1);
    w.resize(4*n+50);
    for(int i = 1; i<=n; i++){
        in >> v[i];
    }

    build(1, 1, n); // O(N)
    
    for(int i = 0; i<m; i++){
        int op, x, y;
        in >> op >> x >> y;   
        if(op == 1){
            out << query(1, 1, n, x, y) << std::endl;
        }
        else{
            update(1, 1, n, x, y);
        }
    }
}