#include <fstream>
#include <algorithm>
#include <unordered_map>

using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int n,m;
long long  v[150001],aib[150001];

int update(int x,int val)
{
    while(x<=n)
    {
        aib[x]+=val;
        x+=x&(-x);
    }

}


long long prefix(int x)
{
    long long  sum=0;
    while(x>0)
    {
        sum+=aib[x];
        x-=x&(-x);

    }
    return sum;
}


int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
        update(i,v[i]);

    }
    for(int i=1;i<=m;i++)
    {
int x,a,b;
        cin>>x;
        if(x==0)
        {
            cin>>a>>b;
            update(a,-b);


        }
        else
        {
            cin>>a>>b;
            cout<<prefix(b)-prefix(a-1)<<'\n';

        }
    }


    return 0;

}