#include <cstdio>
#define zero(x) (x&(-x))
using namespace std;
int a[15001], n;
void update (int p, int val)
{
    for (int i=p; i<=n; i+=zero(i)) a[i]+=val;
}
int query (int p)
{
    int r=0;
    for (int i=p; i>=1; i-=zero(i)) r+=a[i];
    return r;
}
int main()
{
    int m, i, p, x, y;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d%d",&m,&n);
    for (i=1; i<=n; i++)
    {
        scanf("%d",&x);
        update(i,x);
    }
    for (i=1; i<=m; i++)
    {
        scanf("%d%d%d",&p,&x,&y);
        if (p==0) update(x,y*(-1));
        else printf("%d\n",query(y)-query(x-1));
    }
    return 0;
}