#include <bits/stdc++.h>
#define steps(x) (x&(-x))
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int aib[15005],n;

void add(int x,int val)
{
    int i;
    for(i=x;i<=n;i+=steps(i))
    {
        aib[i]+=val;
    }
}
int query(int x)
{
    int i,sol=0;
    for(i=x;i>=1;i-=steps(i))
    {
        sol+=aib[i];
    }
    return sol;
}

int main()
{int m,i,j,t,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
{
    in>>j;
    add(i,j);
}
for(i=1;i<=m;i++)
{
    in>>t>>x>>y;
    if(t==0)
        add(x,-y);
    else
    {
        out<<query(y)-query(x-1)<<'\n';
    }
}
    return 0;
}