#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#define maxNumber 15005
using namespace std;

int number_of_nodes, queries;

class Binary_Tree{
public:
    // data structures
    int nodes[maxNumber]; // stores the values for every node
    // constructors
    void Update(int index, int value);
    int Sum(int position); // the sum of the elements

};


int Binary_Tree :: Sum(int position) {

    int result = 0;
    while(position)
    {
        result += nodes[position];
        position -= (position & (-position));
    }
    return result;
}

void Binary_Tree::Update(int index, int value) {
    while(index <= number_of_nodes)
    {
        nodes[index] += value;
        index += (index & (-index));
    }

}

int main()
{
    ifstream fin("datorii.in");
    ofstream fout("datorii.out");
    fin >> number_of_nodes >> queries;
    Binary_Tree binaryTree;
    memset(binaryTree.nodes,0,maxNumber);
    int add, type, day, val;

    for(int i = 1 ; i <= number_of_nodes; i++)
    {
        fin >> add;
        binaryTree.Update(i,add);
    }

    for(int i = 0 ; i < queries; i++)
    {
        fin >> type >> day >> val;
        if(type == 0) {
            binaryTree.Update(day, -val);
        }
        else
        {
            fout << binaryTree.Sum(val) - binaryTree.Sum(day - 1) << "\n";
        }
    }

    return 0;
}