#include <fstream>
#include <stack>
using namespace std;

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

int n, m, a[15001], v[60001], res = 0;


void init(int nod, int st, int dr)
{
    if(st == dr)
        v[nod] = a[st];
    else
    {
        int mid = (st+dr) / 2;
        init(2*nod, st, mid);
        init(2*nod+1, mid+1, dr);
        v[nod] = v[2*nod] + v[2*nod+1];
    }
}


void update(int nod, int st, int dr, int poz, int sum)
{
    stack<int> stiva;

    while (st != dr) {
        int mid = (st+dr)/2;

        if(poz <= mid) {
            dr = mid;
            stiva.push(nod);
            nod = 2 * nod;
        }
        else {
            st = mid+1;
            stiva.push(nod);
            nod = 2 * nod + 1;
        }
    }

    v[nod] -= sum;

    while (!stiva.empty()) {
        int nod = stiva.top();
        stiva.pop();
        v[nod] = v[2*nod] + v[2*nod+1];
    }
}


void query(int nod, int st, int dr, int s, int d)
{
    stack<pair<int, pair<int,int>>> stiva; // {nod, {st,dr}}
    stiva.push({nod, {st,dr}});

    while (!stiva.empty())
    {
        auto p = stiva.top();
        stiva.pop();
        nod = p.first;
        st = p.second.first;
        dr = p.second.second;

        if(st >= s && dr <= d)
        {
            res += v[nod];
        }
        else {
            int mid = (st+dr)/2;

            if(s <= mid)
                stiva.push({2*nod, {st, mid}});
            if(d > mid)
                stiva.push({2*nod+1, {mid+1, dr}});
        }
    }
}



int main ()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];

    init(1,1,n);

    for(int i = 1; i <= m; i++)
    {
        int t, x, y;
        fin >> t >> x >> y;

        if(t)
        {
            query(1, 1, n, x, y);
            fout << res << '\n';
            res = 0;
        }
        else
            update(1, 1, n, x, y);
    }

    return 0;
}