#include <bits/stdc++.h>
#define NMAX 15010
using namespace std;

ifstream fin("datorii.in");
ofstream gout("datorii.out");

int n, m, arbore[4 * NMAX], op, a, b;

void update(int nod, int st, int dr, int index, int val)
{
    if (st == dr)
    {
        arbore[nod] += val;
        return;
    }
    int mijl = (st + dr) / 2;
    if (index <= mijl)
        update(2 * nod, st, mijl, index, val);
    else
        update(2 * nod + 1, mijl + 1, dr, index, val);
    arbore[nod] = arbore[2 * nod] + arbore[2 * nod + 1];
}

int query(int nod, int st, int dr, int l, int r)
{
    if(st >= l and dr <= r)
        return arbore[nod];
    int mijl = (st + dr) / 2;
    int left_side = 0, right_side = 0;
    if(l <= mijl) left_side = query(2 * nod, st, mijl, l, r);
    if(r > mijl) right_side = query(2 * nod + 1, mijl + 1, dr, l, r);
    return left_side + right_side;
}

int main()
{
    fin >> n >> m;
    for (int i = 1 ; i <= n ; ++i)
    {
        fin >> a;
        update(1, 1, n, i, a);
    }
    for (int i = 0 ; i < m ; ++i)
    {
        fin >> op >> a >> b;
        if(op == 1)
            gout << query(1, 1, n, a, b) << '\n';
        else
            update(1, 1, n, a, -b);
    }

    return 0;
}