#include <bits/stdc++.h>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");

long long a[1000001];
int n,m;
long long valoare;

void add(int start, int stop, int poz1, int val,int poz)
{
    if(start == stop)
    {
        a[poz]=val;
        return;
    }
    if(start!=stop)
    {
        int mid = start+(stop-start)/2;
        if(poz1<=mid) add(start,mid,poz1,val,2*poz);
        else add(mid+1,stop,poz1,val,2*poz+1);
        a[poz]=a[2*poz]+a[2*poz+1];
    }

}

void change(int start, int stop, int poz1, int val, int poz)
{
    if(start == stop)
    {
        a[poz]-=val;
        return;
    }
    if(start!=stop)
    {
        int mid = start+(stop-start)/2;
        if(poz1<=mid) change(start,mid,poz1,val,2*poz);
        else change(mid+1,stop,poz1,val,2*poz+1);
        a[poz]=a[2*poz]+a[2*poz+1];
    }
}


int cauta(int start, int stop, int left, int right, int poz)
{
    if(start>=left && stop <= right)
        return a[poz];

    if(start != stop)
    {
        int a,b;
        a=b=0;
        int mid = start+(stop-start)/2;
       if(right>mid) a=cauta(mid+1,stop,left,right,2*poz+1);
       if(left<=mid) b=cauta(start,mid,left,right,2*poz);
       return a+b;
    }

}

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;++i)
    {
        int x;
        f>>x;
        add(1,n,i,x,1);
    }
    for(int i=1;i<=m;++i)
    {
        int x,y,z;
        f>>x>>y>>z;
        if(x==0)
            change(1,n,y,z,1);
        else
            g<<cauta(1,n,y,z,1)<<'\n';

    }
    return 0;
}