#include <cstdio>

#define NMAX 15005

int N, M, arb[4 * NMAX], a, b, sum;

void actualizare(int nod, int st, int dr)
{
    if (st == dr)
    {
        arb[nod] += b;
        return;
    }

    int mij = (st + dr) / 2;

    if (a <= mij)
        actualizare(2 * nod, st, mij);
    else
        actualizare(2 * nod + 1, mij + 1, dr);

    arb[nod] = arb[2 * nod] + arb[2 * nod + 1];
}

void interogare(int nod, int st, int dr)
{
    if (a <= st && dr <= b)
    {
        sum += arb[nod];
        return;
    }

    int mij = (st + dr) / 2;

    if (a <= mij)
        interogare(2 * nod, st, mij);
    if (b > mij)
        interogare(2 * nod + 1, mij + 1, dr);
}

void citire()
{
    scanf("%d %d", &N, &M);

    for (a = 1; a <= N; ++a)
    {
        scanf("%d", &b);
        actualizare(1, 1, N);
    }
}

void rezolvare()
{
    int t;

    for (int i = 1; i <= M; ++i)
    {
        scanf("%d %d %d", &t, &a, &b);
        if (t == 0)
        {
            b = -b;
            actualizare(1, 1, N);
        }
        else
        {
            sum = 0;
            interogare(1, 1, N);
            printf("%d\n", sum);
        }
    }
}

int main()
{
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);

    citire();
    rezolvare();

    return 0;
}