#include <bits/stdc++.h>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,aib[20001],st,dr,x,y,m,t;
void adun(int x,int a)
{
    for(int i=x;i<=n;i+=(i&-i))aib[i]+=a;
}
long long suma(int x)
{
    long long s=0;
    for(int i=x;i>=1;i-=(i&-i))s+=aib[i];
    return s;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        adun(i,x);
    }
    while(m)
    {
        m--;
        fin>>t;
        if(t==0)
        {
            fin>>x>>y;
            adun(x,-y);
        }
        else
        {
            fin>>st>>dr;
            fout<<suma(dr)-suma(st-1)<<'\n';
        }
    }
    return 0;
}