#include <fstream>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int sum;
int A[60005];
int cost[15005];
void build_tree(int nod,int left,int right)
{
    if(left==right)
    {
        A[nod]=cost[left];
    }
    else
    {
        int mid=(left+right)/2;
        build_tree(2*nod,left,mid);
        build_tree(2*nod+1,mid+1,right);
        A[nod]=A[2*nod]+A[2*nod+1];
    }
}
void update(int nod,int left,int right,int position,int value)
{
    if(left==right)
    {
        A[nod]=value;
    }
    else
    {
        int mid=(left+right)/2;
        if (position<=mid)update(2*nod,left,mid,position,value);

            else if(mid<position)update(2*nod+1,mid+1,right,position,value);
        A[nod]=A[2*nod]+A[2*nod+1];

    }
}
void query(int nod,int left,int right,int a,int b)
{
    if(a<=left&&right<=b)
    {
        sum=sum+A[nod];
    }
    else
    {
        int mid=(left+right)/2;
        if(a<=mid)query(2*nod,left,mid,a,b);
        if(mid+1<=b)query(2*nod+1,mid+1,right,a,b);
    }
}

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        fin>>cost[i];
    }
   build_tree(1,1,n);
    while(m--)
    {int c,a,b;
        fin>>c>>a>>b;

        if(c==1)
        {    sum=0;
            query(1,1,n,a,b);
            fout<<sum<<"\n";
        }
        else if(c==0)
        {
            cost[a]=cost[a]-b;
            update(1,1,n,a,cost[a]);
        }
    }
    return 0;
}