#include <fstream>
//#include <iostream>
#include <deque>
#include <set>
#include <climits>
using namespace std;

ifstream cin("datorii.in");
ofstream cout("datorii.out");

const int NMAX = 15004;
int v[NMAX];

int s(int p, int q)
{
    if (p == q)
        return v[p];
    return s(p, (p + q) / 2) + s((p + q) / 2 + 1, q);
}
int main()
{
    int n, m, i;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
        cin >> v[i];
    while (m--)
    {
        int cod, p, q;
        cin >> cod >> p >> q;
        if (cod == 0)
            v[p] -= q;
        else
            cout << s(p, q) << "\n";
    }
}