#include <iostream>
#include <fstream>
using namespace std;

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

const int MAXN = 60005;
int arb[MAXN];

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        arb[nod] += val;
        return;
    }

    int m = (st + dr) / 2;

    if(pos <= m)
    {
        update(2 * nod, st, m, pos, val);
    }
    else
    {
        update(2 * nod + 1, m + 1, dr, pos, val);
    }

    arb[nod] += val;
}

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

    int m = (st + dr) / 2;

    if(a <= m)
    {
        query(2 * nod, st, m, a, b, suma);
    }

    if(m + 1 <= b)
    {
         query(2 * nod + 1, m + 1, dr, a, b, suma);
    }
}

int main()
{
    int n, m, x;
    in >> n >> m;

    for(int i = 1; i <= n; i++)
    {
        in >> x;
        update(1, 1, n, i, x);
    }

    int tip, a, b;

    for(int i = 1; i <= m; i++)
    {
        in >> tip >> a >> b;

        if(tip == 0)
        {
            update(1, 1, n, a, -b);
        }
        else
        {
            int suma = 0;
            query(1, 1, n, a, b, suma);
            out << suma << '\n';
        }
    }

    in.close();
    out.close();

    return 0;
}