#include <fstream>

using namespace std;

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

int n, t, aib[15005], op, x, y;

void Update (int p, int x)
{
    for (; p <= n; p += (p & -p))
        aib[p] += x;
}

int Query1 (int p) /// a[1] + a[2] + ... a[p]
{
    int s;
    for (s = 0; p > 0; p -= (p & -p))
        s += aib[p];
    return s;
}


void Solve ()
{
    int i;
    fin >> n >> t;
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    for (i = 1; i <= t; i++)
    {
        fin >> op >> x >> y;
        if (op == 0)
            Update(x, -y);
        else
            fout << Query1(y) - Query1(x - 1) << "\n";
    }
    fout.close();
}

int main()
{
    Solve();
    return 0;
}