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

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

const int Dim = 15002;

int n, m;
int val, pos, sol, A, B;
int a[Dim*4 + 6];

void Update(int x, int l, int r);
void Query(int x, int l, int r);

int main()
{
    fin >> n >> m;


    int x, y, z;

    for ( int i = 1; i <= n; i++ )
    {
        fin >> val;
        pos = i;
        Update(1, 1, n);
    }

    for ( int i = 1; i <= m; i++ )
    {
        fin >> x >> y >> z;
        if ( x == 0 )
        {
            pos = y;
            val = -z;
            Update(1, 1, n);
        }
        else
        {
            sol = 0;
            A = y;
            B = z;
            Query( 1, 1, n);
            fout << sol << '\n';
        }

    }

    fin.close();
    fout.close();
    return 0;
}

void Update(int x, int l, int r)
{
    if ( l == r )
    {
        a[x] += val;
        return;
    }

    int mid = (l + r) / 2;

    if ( pos <= mid )
        Update( 2 * x, l, mid);
    else
        Update( 2 * x + 1, mid + 1, r);

    a[x] = a[2*x] + a[2*x+1];
}
void Query(int x, int l, int r)
{
    if ( A <= l && r <= B )
    {
        sol += a[x];
        return;
    }

    int mid = (l + r) / 2;

    if ( A <= mid )
        Query( 2 * x, l, mid);
    if ( mid < B )
        Query( 2 * x + 1, mid + 1, r);
}