#include <iostream>
#include <fstream>
#include <algorithm>

///#include <PRACTICE>

using namespace std;

ifstream fin ("datorii.in");
ofstream fout ("datorii.out");

const int NMAX=1e5+5;
int v[NMAX];
int aib[NMAX];
int n;

int lsb(int x)
{
    return x^(x&(x-1));
}

void build(int p,int val)
{
    while(p<=n)
    {
        aib[p]+=val;
        p+=lsb(p);
    }
}

void update(int p,int val)
{
    while(p<=n)
    {
        aib[p]-=val;
        p+=lsb(p);
    }
}

long long query(int p)
{
    long long s=0;
    while(p>0)
    {
        s+=aib[p];
        p-=lsb(p);
    }
    return s;
}

int main()
{
    int m,i,x,y,t;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        build(i,v[i]);
    }
    for(i=1;i<=m;i++)
    {
        fin>>t>>x>>y;
        if(t==0)
            update(x,y);
        else
            fout<<query(y)-query(x-1)<<"\n";
    }
    return 0;
}