#include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("O2")
using namespace std;
int st[20000005], pozi[100005];

void update(int node, int from, int to, int pos, int val)
{
    if(from==to)
    {
        st[node]=val;
        pozi[pos]=node;
        return;
    }
    int mid=(from+to)/2;
    if(pos<=mid)
    {
        update(node*2, from, mid, pos, val);
    }
    else
    {
        update(node*2+1, mid+1, to, pos, val);
    }

    st[node]=st[node*2]+st[node*2+1];
}

int query(int node, int from, int to, int qleft, int qright)
{
    int smax=0;
    if(qleft<=from && to<=qright)
    {
        return st[node];
    }
    int mid=(from+to)/2;
    if(qleft<=mid)
    {
        int s=query(node*2, from, mid, qleft, qright);
        smax+=s;
    }

    if(mid+1<=qright)
    {
        int s=query(node*2+1, mid+1, to, qleft, qright);
        smax+=s;
    }

    return smax;
}

int32_t main()
{
    ifstream cin("datorii.in");
    ofstream cout("datorii.out");
    int n, q, a, x, y;
    cin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        cin>>a;
        update(1, 1, n, i, a);
    }
    for(int i=1; i<=q; i++)
    {
        cin>>a>>x>>y;
        if(a==0)
        {
            int nr=st[pozi[x]];
            update(1, 1, n, x, -nr);
            nr-=y;
            update(1, 1, n, x, nr);
        }
        else
        {
            cout<<query(1, 1, n, x, y)<<'\n';
        }
    }
    return 0;
}