#include <bits/stdc++.h>

using namespace std;

int aib[15005];
int n, Q;

int Query(int p)
{
    int s = 0;
    while (p > 0)
    {
        s += aib[p];
        p -= (p & (-p));
    }
    return s;
}

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

int main()
{
    ifstream fin("datorii.in");
    ofstream fout("datorii.out");
    int x, y, op;
    fin >> n >> Q;
    for (int i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }

    while(Q--)
    {
        fin >> op >> x >> y;
        if (op)
            fout << Query(y) - Query(x - 1) << "\n";
        else Update(x, -y);
    }
    fin.close();
    fout.close();
    return 0;
}