#include <fstream>
#include <vector>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, i, m, x, y;
vector <int> t;
void update (int p, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        t[p] = val;
        return;
    }
    int m = (st+dr)/2, ps = 2*p, pd = 2*p+1;
    if (poz <= m)
        update (ps, st, m, poz, val);
    else
        update (pd, m+1, dr, poz, val);
    t[p] = t[ps] + t[pd];
}
int query (int p, int st, int dr, int a, int b)
{
    if (a <= st && dr <= b)
        return t[p];
    int m = (st + dr)/2, ps = 2*p, pd = 2*p+1, rs = 0, rd = 0;
    if (a <= m)
        rs = query (ps, st, m, a, b);
    if (m+1 <= b)
        rd = query (pd, m+1, dr, a, b);
    return rs + rd;
}
int main()
{
    fin >> n >> m; t.resize(4*n+1);
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        update(1, 1, n, i, x);
    }
    bool op;
    for (int mc = 1; mc <= m; mc++)
    {
        fin >> op >> x >> y;
        if (op)
            fout << query (1, 1, n, x, y) << "\n";
        else
            update (1, 1, n, x, max (query (1, 1, n, x, x)-y, 0));
    }
    return 0;
}