#include <iostream>
#include <cstdio>

using namespace std;

FILE *fin=fopen("datorii.in", "r");
FILE *fout=fopen("datorii.out", "w");

long arbore[30200], n, m, v, t, p, q;

void Update(int nod, int a, int b)
{
    if (a==b && a==t)
    {
        arbore[nod]-=v;
    }
    else
    {
        int d=(a+b)/2;
        if (t<=d)
        {
            Update(nod*2, a, d);
        }
        else
        {
            Update(nod*2+1, d+1, b);
        }
        arbore[nod]=arbore[nod*2]+arbore[nod*2+1];
    }
}

int Interogare(int nod, int a, int b)
{
    if (p<=a && q>=b)
        return arbore[nod];
    int d=(a+b)/2, sum=0;
    if (p<=d)
        sum+=Interogare(nod*2, a, d);
    if (d+1<=q)
        sum+=Interogare(nod*2+1, d+1, b);
    return sum;
}

int main()
{
    fscanf(fin, "%d%d", &n, &m);
    for (int i=1; i<=n; i++)
    {
        int x;
        t=i;
        fscanf(fin, "%d", &x);
        v=-1*x;
        Update(1, 1, n);
    }
    for (int i=1; i<=m; i++)
    {
        int x;
        fscanf(fin, "%d", &x);
        if (x==0)
        {
            fscanf(fin, "%d%d", &t, &v);
            Update(1, 1, n);
        }
        else
        {
            fscanf(fin, "%d%d", &p, &q);
            fprintf(fout, "%d\n", Interogare(1, 1, n));
        }
    }
    return 0;
}