#include <bits/stdc++.h>

using namespace std;
const int Nmax = 15000 + 5;
ifstream f("datorii.in");
ofstream g("datorii.out");

int n, m, aint[Nmax * 4];

void Update(int node, int ls, int rs, int pos, int val)
{
    if (ls == rs && ls == pos) {
        aint[node] -= val;
        return;
    }
    int mid = (ls + rs) >> 1;
    if (pos <= mid)
        Update(node * 2, ls, mid, pos, val);
    if (pos > mid)
        Update(node * 2 + 1, mid + 1, rs, pos, val);
    aint[node] = aint[node * 2] + aint[node * 2 + 1];
}

int Query(int node, int ls, int rs, int a, int b)
{
    if (a <= ls && b >= rs)
        return aint[node];
    int mid, A, B;
    mid = (ls + rs) >> 1;
    A = B = 0;
    if (a <= mid)
        A = Query(node * 2, ls, mid, a, b);
    if (b > mid)
        B = Query(node * 2 + 1, mid + 1, rs, a, b);
    return A + B;
}

void read()
{
    f >> n >> m;

    int x;
    for (int i = 1; i <= n; ++i) {
        f >> x;
        Update(1, 1, n, i, -x);
    }
}

void show()
{
    int c, a, b;
    for (int i = 1; i <= m; ++i) {
        f >> c >> a >> b;
        if (c == 0)
            Update(1, 1, n, a, b);
        else
            g << Query(1,  1, n, a, b) << "\n";
    }
}

int main()
{
    read();
    show();
    return 0;
}