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

///#include <tryhardmode>

using namespace std;

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

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

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

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

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

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

int main()
{
    int i,j,m,t,cod,ve,p,q;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        update(i,v[i]);
    }
    for(i=1;i<=m;i++)
    {
        fin>>cod;
        if(cod==0)
        {
            fin>>t>>ve;
            update2(t,ve);
        }
        else
        {
            fin>>p>>q;
            fout<<solve(q)-solve(p-1)<<"\n";
        }
    }
    return 0;
}