#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int a[NMAX*4],v[NMAX],n,m,poz,start,stop;
void build(int l, int r, int node)
{
    if(l==r) a[node]=v[l];
    else
    {
        int mid=(l+r)/2;
        build(l,mid,2*node);
        build(mid+1,r,2*node+1);
        a[node]=a[2*node]+a[2*node+1];
    }
}
int query(int l, int r, int node)
{
    if(start<=l and stop>=r)
    {
        return a[node];
    }
    else
    {
        int mid=(l+r)/2;
        int suml=0,sumr=0;
        if(start<=mid) suml=query(l,mid,2*node);
        if(mid+1<=stop) sumr=query(mid+1,r,2*node+1);
        return suml+sumr;
    }
}
void update(int l, int r, int node)
{
    if(l==r) a[node]=v[l];
    else
    {
        int mid=(l+r)/2;
        if(poz<=mid) update(l,mid,2*node);
        else update(mid+1,r,2*node+1);
        a[node]=a[2*node]+a[2*node+1];
    }
}
int main()
{
    f>>n>>m;
    int i,x,y;
    bool op;
    for(i=1;i<=n;i++)
        f>>v[i];
    build(1,n,1);
    int quest;
    for(quest=1;quest<=m;quest++)
    {
        f>>op>>x>>y;
        if(op==1)
        {
            start=x;
            stop=y;
            g<<query(1,n,1)<<"\n";
        }
        else
        {
            v[x]-=y;
            poz=x;
            update(1,n,1);
        }
    }
    return 0;
}