#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

const int N = 15000;

int arb[4*N + 1];
int v[N + 1];

void uniteNodes(int parent, int firstChildNode, int secondChildNode){
    arb[parent] = arb[firstChildNode] + arb[secondChildNode];
}

int uniteQueries(int query1, int query2){
    return query1 + query2;
}

void build(int node, int left, int right){
    if(left == right){
        arb[node] = v[left];
        return;
    }

    int middle = (left + right) / 2;
    build(2*node, left, middle);
    build(2*node + 1, middle + 1, right);
    uniteNodes(node, 2*node, 2*node + 1);
}

void update(int node, int left, int right, int where, int value){
    if(left == right){
        arb[node] += value;
        return;
    }

    int middle = (left + right) / 2;
    if(where <= middle)
        update(2*node, left, middle, where, value);
    else
        update(2*node + 1, middle + 1, right, where, value);

    uniteNodes(node, 2*node, 2*node + 1);
}

int query(int node, int left, int right, int L, int R){
    if(right < L || left > R)
        return 0;
    if(L <= left && right <= R)
        return arb[node];

    int middle = (left + right) / 2;
    int query1 = query(2*node, left, middle, L, R);
    int query2 = query(2*node + 1, middle + 1, right, L, R);

    return uniteQueries(query1, query2);
}

int main()
{
    int n, m, i, op, a, b;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        fin >> v[i];

    build(1, 1, n);

    for(i = 1; i <= m; i++){
        fin >> op >> a >> b;
        if(op == 0)
            update(1, 1, n, a, -b);
        else
            fout << query(1, 1, n, a, b) << "\n";
    }
    return 0;
}