#include <fstream>
#include <cmath>

using namespace std;

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

long long n,m,aib[100005],a,p;


void update(long long x, long long b)
{
    for(int i=x;i<=n;i+=(i&(-i)))
        aib[i]-=b;
}

long long query(long long x)
{
    if(x<=0)
        return 0;
    long long ans=0;
    for(int i=x;i>0;i-=(i&(-i)))
        ans+=aib[i];
    return ans;
}

/*long long bsaib(long long x)
{
    long long pas=p,ans=0,pnacm=0;
    while(pas>0)
    {
        if(pas+ans<=n && pnacm+aib[pas+ans]<x)
            ans+=pas,pnacm+=aib[ans];
        pas/=2;
    }
    if(query(ans+1)==x)
        return ans+1;
    return -1;
}*/


int main()
{
    cin>>n>>m;
    ///p=(1<<((long long)log2(n)));
    for(int i=1;i<=n;i++)
    {
        cin>>a;
        update(i,-a);
    }
    for(int i=0;i<m;i++)
    {
        long long cer, b;
        cin>>cer>>a;
        if(cer==0)
        {
            cin>>b;
            update(a,b);
        }
        if(cer==1)
        {
            cin>>b;
            cout<<query(b)-query(a-1)<<'\n';
        }
        /*if(cer==2)
            cout<<bsaib(a)<<'\n';*/
    }
}