#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int aint[60006];
void insertt(int n, int left, int right, int poz, int val)
{
    if(left==right)
    {
        aint[n]=val;
        return;
    }
    int mid=(left+right)/2;
    if(poz<=mid){ insertt(2*n, left,mid, poz,val);}
    else{insertt(2*n+1,mid+1,right,poz,val);}
    aint[n]=aint[2*n]+aint[2*n+1];
}
void update(int n, int left, int right, int poz, int val)
{
    if(left==right)
    {
        aint[n]=aint[n]-val;
        return;
    }
    int mid=(left+right)/2;
    if(poz<=mid){ update(2*n, left,mid, poz,val);}
    else{update(2*n+1,mid+1,right,poz,val);}
    aint[n]=aint[2*n]+aint[2*n+1];
}
int query(int n, int left, int right, int a,int b)
{
    if(a<=left && right<=b){return aint[n];}
    int v1=0, v2=0;
    int mid =(left+right)/2;
    if(a<=mid){v1=query(2*n,left,mid,a,b);}
    if(b>mid){v2=query(2*n+1, mid+1,right, a ,b);}
    return v1+v2;
}

int main()
{
    int n,m,cer,a,b,x;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        insertt(1,1,n,i,x);
    }
    for(int i=1;i<=m;i++)
    {
        fin>>cer>>a>>b;
        if(cer==0)
        {
            update(1,1,n,a,b);
        }
        if(cer==1)
        {
            fout<<query(1,1,n,a,b)<<'\n';
        }
    }
    return 0;
}