#include <iostream>
#include <fstream>

#define NMAX 15005

using namespace std;

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

int N, M;

int aib[NMAX];
int a, b;

void Update(int pos, int value)
{
    while (pos <= N) {
        aib[pos] += value;
        pos += (pos & (-pos));
    }
}

int Query(int pos)
{
    int sum = 0;
    while (pos) {
        sum += aib[pos];
        pos -= (pos & (-pos));
    }
    return sum;
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= N; i ++)
    {
        fin >> a;
        Update(i, a);
    }
    int test;
    for(int i = 1; i <= M; i ++)
    {
        fin >> test >> a >> b;
        if(test) fout << Query(b) - Query(a - 1) << "\n";
        else Update(a, -b);
    }


}