#include <iostream>
#include <fstream>

using namespace std;

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

int n,m,suma;
int arb[60005],v[15005];
void Build(int nod,int st,int dr,int val,int poz)
{
    if(st>=poz&&dr<=poz){
        arb[nod]=val;
        return;
    }
    int mij=(st+dr)/2;
    if(poz<=mij)
        Build(2*nod,st,mij,val,poz);
    if(poz>mij)
        Build(2*nod+1,mij+1,dr,val,poz);
    arb[nod]=arb[2*nod]+arb[2*nod+1];
}
int query(int nod,int st,int dr,int a,int b)
{
    if(st>=a&&dr<=b){
        return arb[nod];
    }
    if(dr<a||st>b)
        return 0;
    int mij=(st+dr)/2;
    return suma=query(2*nod,st,mij,a,b)+query(2*nod+1,mij+1,dr,a,b);
}
int main()
{
    int cer,a,b;
    in>>n>>m;
    for(int i=1;i<=n;++i){
        in>>v[i];
        Build(1,1,n,v[i],i);
    }
    for(int i=1;i<=m;++i){
        in>>cer>>a>>b;
        if(cer==1){
            suma=0;
            out<<query(1,1,n,a,b)<<'\n';

        }
        else{
            v[a]-=b;
            Build(1,1,n,v[a],a);
        }
    }
    return 0;
}