#include <fstream>
using namespace std;
ifstream in ("datorii.in");
ofstream out ("datorii.out");
int n, m, cod, poz, val, AIB[15001];

void update (int poz, int val)
{
    while (poz <= n)
    {
        AIB[poz] = AIB[poz] + val;
        poz = poz + ( poz & (-poz) );
    }
}

int query (int poz)
{
    int s = 0;
    while (poz)
    {
        s = s + AIB[poz];
        poz = poz - ( poz & (-poz) );
    }
    return s;
}

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int a; in >> a;
        update(i, a);
    }
    for (int i = 1; i <= m; i++)
    {
        in >> cod >> poz >> val;
        if (cod == 0) update(poz, -val);
        if (cod == 1) out << query(val) - query(poz - 1) << '\n';
    }
    out.close(); return 0;
}