#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
unsigned int n,m,a,b,op,x,aint[60000];
void construire(int n, int left, int right, int pos, int val)
{   if(left==right)
    {   aint[n]=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        construire(2*n,left,mid,pos,val);
    else
        construire(2*n+1,mid+1,right,pos,val);
    aint[n]=aint[n*2]+aint[n*2+1];
    return;
}
void update(int n, int left, int right, int pos, int val)
{   if(left==right)
    {   aint[n]=aint[n]-val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        update(2*n,left,mid,pos,val);
    else
        update(2*n+1,mid+1,right,pos,val);
    aint[n]=aint[n*2]+aint[n*2+1];
}
int query(int n, int left, int right, int a, int b)
{   if(a<=left && right<=b)
        return aint[n];
    int mid=(left+right)/2;
    int v1=0;
    int v2=0;
    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()
{   f>>n>>m;
    for(int i=1;i<=n;i++)
    {   f>>x;
        construire(1,1,n,i,x);
    }
    for(int i=1;i<=m;i++)
    {   f>>op>>a>>b;
        if(op==0)
            update(1,1,n,a,b);
        if(op==1)
            g<<query(1,1,n,a,b)<<'\n';
    }
    return 0;
}