#include <fstream>

using namespace std;

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

int n, m;
int a[15001];
int aint[2 * 15001];

void Build(int node, int left, int right)
{
    if(left == right)
        aint[node] = a[left];
    else
    {
        int mid = (left + right) / 2;
        Build(node * 2, left, mid);
        Build(node * 2 + 1, mid + 1, right);
        aint[node] = aint[node * 2] + aint[node * 2 + 1];
    }
}

void Update(int node, int left, int right, int pos, int value)
{
    if(left == right)
        aint[node] -= value;
    else
    {
        int mid = (left + right) / 2;
        if(mid <= pos)
            Update(node * 2, left, mid, pos, value);
        else
            Update(node * 2 + 1, mid + 1, right, pos, value);

        aint[node] = aint[node * 2] + aint[node * 2 + 1];
    }
}

int Query(int node, int left, int right, int Qleft, int Qright)
{
    if(left >= Qleft && right <= Qright)
        return aint[node];

    if(left > Qright || right < Qleft)
        return 0;

    int mid = (left + right) / 2;
    return Query(node * 2, left, mid, Qleft, Qright) +
        Query(node * 2 + 1, mid + 1, right, Qleft, Qright);
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> a[i];

    Build(1, 1, n);
    for(int i = 1; i <= m; i++)
    {
        int tip, x, y;
        cin >> tip >> x >> y;
        if(tip == 0)
            Update(1, 1, n, x, y);
        else
            cout << Query(1, 1, n, x, y);
    }
    return 0;
}