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

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

struct Entry2 {
    int nod;
    int st;
    int dr;
};

int n, m, a[15001], v[60001], res = 0;
vector<Entry2> vec;

struct Entry {
    int nod;
    int st;
    int dr;
    int state;
};


void init(int nod, int st, int dr)
{
    stack<Entry> stiva;
    // nod+st+dr, STATE
    // STATE == 0 am fost aici si m-am dus in stanga
    // STATE == 1 am fost aici si m-am dus in dreapta

    while (!stiva.empty() || nod != -1) {
        if (nod == -1) {
            auto &e = stiva.top();
            nod = e.nod;
            st = e.st;
            dr = e.dr;

            if (e.state == 0) {
                int mid = (st+dr) / 2;
                nod = 2*nod+1;
                st = mid+1;
                e.state= 1;
            }
            else {
                stiva.pop();
                v[nod] = v[2*nod] + v[2*nod+1];
                nod = -1;
            }
        }
        else {
            if(st == dr) {
                v[nod] = a[st];
                nod = -1;
            }
            else {
                int mid = (st+dr) / 2;
                Entry e;
                e.nod = nod;
                e.st = st;
                e.dr = dr;
                e.state = 0;
                stiva.push(e);
                nod = 2*nod;
                dr = mid;
            }
        }
    }
}


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)
{
    int k = 0;

    while (k > 0 || nod != -1)
    {
        if (nod == -1) {
            --k;
            Entry2 &e = vec[k];
            nod = e.nod;
            st = e.st;
            dr = e.dr;
        }

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

            if(s <= mid) {
                Entry2 &e = vec[k];
                e.nod = 2*nod;
                e.st = st;
                e.dr = mid;
                ++k;
            }

            if(d > mid) {
                nod = 2*nod+1;
                st = mid+1;
            }
            else {
                nod = -1;
            }
        }
    }
}


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

    vec.resize(n+1);

    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;
}