#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 15005;
int n, m, arr[NMAX], arb[4*NMAX], ans, cnt = 0;

inline void update(int node, int st, int dr, int poz, int val, bool adaos)
{
    if(st == dr)
    {
        if(adaos)
            arb[node] = val;
        else
            arb[node]-=val;
        return;
    }
    int mid = (st + dr)/2;
    if(poz <= mid)
        update(node*2, st, mid, poz, val, adaos);
    else
        update(node*2+1, mid+1, dr, poz, val, adaos);
    arb[node]=arb[node*2]+arb[node*2+1];
}

inline void query(int node, int ArbSt, int ArbDr, int st, int dr)
{
    if(ArbDr < st || dr < ArbSt)
        return;
    if(ArbSt >= st && ArbDr <= dr)
    {
        ans+= arb[node];
        return;
    }
    int mid = (ArbSt+ArbDr)/2;
    query(node*2, ArbSt, mid, st , dr);
    query(node*2+1, mid+1, ArbDr, st, dr);
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;++i)
    {
        fin >> arr[i];
        update(1,1,n,i,arr[i],true);
    }
    bool x;
    int a, b;
    //cout << arb[7];
    while(m--)
    {
        fin >> x >> a >> b;
        if(x == 0)
        {
            update(1,1,n,a,b,false);
        }
        else
        {
            ans = 0;
            query(1,1,n,a,b);
            fout << ans << '\n';
        }
    }
}