#include <bits/stdc++.h>

using namespace std;

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

const int lmax = 15007;
int n, m;
int v[lmax * 4];

void update(int pos, int l, int r, int a, int val)
{
    if (l == r)
    {
        v[pos] += val;
        return;
    }
    int mid = (l + r) / 2;

    if (a <= mid)
    {
        update(pos * 2, l, mid, a, val);
    }
    else
    {
        update(pos * 2 + 1, mid + 1, r, a, val);
    }

    v[pos] = v[pos * 2] + v[pos * 2 + 1];
}

int query(int pos, int l, int r, int x, int y)
{
    if (x <= l && r <= y)
    {
        return v[pos];
    }

    int s = 0;
    int mid = (l + r) / 2;

    if(x <= mid)
    {
        s += query(pos * 2, l, mid, x, y);
    }
    if(y > mid)
    {
        s += query(pos * 2 + 1, mid + 1, r, x, y);
    }

    return s;
}
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        fin >> x;
        update(1, 1, n, i, x);
    }

    for (int i = 1; i <= m; i++)
    {
        int op, p, q;
        fin >> op >> p >> q;
        if (op == 0)
        {
            update(1, 1, n, p, -q);
        }
        else
        {
            fout << query(1, 1, n, p, q)<< "\n";
        }
    }
    return 0;
}