#include <bits/stdc++.h>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,k,v[200005],s,tree[200005],m,x,y,i,j,op;
void add(int k,long long int val)
{
    while(k<=n)
    {
        tree[k]=tree[k]+val;
        k=k+(k&-k);
    }
}
long long int sum(int k)
{
    long long s=0;
    while(k>=1)
    {
        s=s+tree[k];
        k=k-(k&-k);
    }
    return s;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;++i)
    {
        fin>>v[i];
        add(i,v[i]);
    }
    for(i=1;i<=m;++i)
    {
        fin>>op>>x>>y;
        if(op==1)
        {
            add(x,-y);
            v[x]=v[x]-y;
        }
        else if(op==2)
        {
            fout<<sum(y)-sum(x-1)<<endl;
        }
    }

    return 0;
}