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

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

int n, m, t, v, p, q, operatie;

int creeazaArboreInt(int* datorii, int i, int st, int dr, int* arbint)
{
    if(st == dr)
        return arbint[i] = datorii[dr];
    else
        return arbint[i] = creeazaArboreInt(datorii, 2*i, st, (dr+st)/2, arbint) + creeazaArboreInt(datorii, 2*i+1, (dr+st)/2+1, dr, arbint);
}

void achitare(int* arbint, int t, int v, int st, int dr, int i)
{
    if(t == dr && st == dr)
        arbint[i] -= v;
    else if((st != dr) && (t <= dr && t >= st))
    {
        achitare(arbint, t, v, st, (st+dr)/2, 2*i);
        achitare(arbint, t, v, (st+dr)/2+1, dr, 2*i+1);
        arbint[i] -= v;
    }
}

int interogare(int* arbint, int p, int q, int st, int dr, int i)
{
    if(p <= st && q >= dr)
        return arbint[i];
    else if(st > q || dr < p)
        return 0;
    else
    {
        return interogare(arbint, p, q, st, (st+dr)/2, i*2) + interogare(arbint, p, q, (st+dr)/2+1, dr, i*2+1);
    }
}

int main()
{
    
    fin >> n >> m;
    
    int* datorii = new int [n];
    int* arbint = new int [4*n];
    
    for(int i = 0; i < n; i++)
        fin >> datorii[i];
    
    creeazaArboreInt(datorii, 1, 0, n-1, arbint);
    
    while(m)
    {
        fin >> operatie;
        if(operatie == 0)
        {
            fin >> t >> v;
            achitare(arbint, t-1, v, 0, n-1, 1);
        }
        else if(operatie == 1)
        {
            fin >> p >> q;
            fout << interogare(arbint, p-1, q-1, 0, n-1, 1) << endl;
        }
        m--;
    }
    
    fin.close();
    fout.close();
    return 0;
}