#include <iostream>
#include <fstream>

using namespace std;

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

int X[15001], n, m;

void Add(int poz, int val)
{
    for (int i = poz; i <= n; i += i & -i)
        X[i] += val;
}

int Query(int poz)
{
    int sum = 0;
    for (int i = poz; i; i -= i & -i)
        sum += X[i];

    return sum;
}

int main()
{
    fin >> n >> m;
    for (int i = 1, a; i <= n; i ++)
    {
        fin >> a;
        Add(i, a);
    }

    while (m --)
    {
        int type, a, b;
        fin >> type >> a >> b;
        if (type)
            fout << Query(b) - Query(a - 1) << '\n';
        else
            Add(a, -b);
    }
}