#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");

constexpr int nmax = 15001;
int a[nmax], d[nmax * 4];
int n, m;

void build(int v, int st, int dr);
void update(int v, int st, int dr, int poz, int val);
int query(int v, int st, int dr, int str, int drr);
int main()
{
    in >> n >> m;
    for ( int i = 1; i <= n; ++i )
        in >> a[i];
    build(1, 1, n);

    for ( int i = 1; i <= m; ++i )
    {
        int c, st, dr;
        in >> c >> st >> dr;
        if ( c == 0 )
            update(1, 1, n, st, dr);
        else out << query(1, 1, n, st, dr) << "\n";
    }
    return 0;
}

void build(int v, int st, int dr)
{
    if ( st == dr )
    {
      d[v] = a[st];
      return;
    }
    int mij = ( st + dr)/2;
    build( v * 2, st, mij );
    build( v * 2 + 1, mij + 1, dr);
    d[v] = d[v * 2] + d[v * 2 + 1];
}

void update(int v, int st, int dr, int poz, int val)
{
    if ( st == dr )
        {
            d[v]-=val;
            return;
        }
    int mij = (st + dr)/2;
    if ( poz <= mij )
       update(v * 2, st, mij, poz, val);
    else
       update(v * 2 + 1, mij + 1, dr, poz, val);
    d[v] = d[v * 2] + d[v * 2 + 1];
}

int query(int v, int st, int dr, int str, int drr)
{
    if ( str > drr )
        return 0;
    if ( str == st and drr == dr )
        return d[v];
    int mij = ( st + dr )/2;
    return query(v * 2, st, mij, str, min(drr, mij)) +
           query(v * 2 + 1, mij + 1, dr, max(str, mij + 1), drr);
}