#include <bits/stdc++.h>

using namespace std;

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

const int MAX = 61000;

int t[MAX], a, b, poz, val;

void actualizare(int p, int st, int dr, int poz, int val)
{
    if(st == dr)
    {
        t[p] += val;
        return;
    }
    int m = (st + dr) / 2;
    if(poz <= m)
    {
        actualizare(2 * p, st, m, poz, val);
    }
    else
    {
        actualizare(2 * p + 1, m + 1, dr, poz, val);
    }
    t[p] = t[2 * p] + t[2 * p + 1];
}

int interogare(int p, int st, int dr, int a, int b)
{
    if(a <= st && dr <= b)
    {
        return t[p];
    }
    int m = (st + dr) / 2;
    int maxst = 0;
    int maxdr = 0;
    if(a <= m)
    {
        maxst = interogare(2 * p, st, m, a, b);
    }
    if(b > m)
    {
        maxdr = interogare(2 * p + 1, m + 1, dr, a, b);
    }
    return maxst + maxdr;
}

int main()
{
    int n, m, op, x, y;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        in >> val;
        poz = i;
        actualizare(1, 1, n, poz, val);
    }
    for(int i = 1; i <= m; i++)
    {
        in >> op >> x >> y;
        if(op == 0)
        {
            actualizare(1, 1, n, x, -y);
        }
        else
        {
            out << interogare(1, 1, n, x, y) << "\n";
        }
    }
    return 0;
}