#include <bits/stdc++.h>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int NMAX = 15000;
int n, m;
int tree[4 * (NMAX + 5)];
int q, a, b;
int q_ans;

void build(int node, int l, int r)
{
    if(l == r)
    {
        in >> tree[node];
        return;
    }

    int m = (l + r) / 2;

    build(2 * node, l, m);
    build(2 * node + 1, m + 1, r);

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

void update(int node, int l, int r, int a, int val)
{
    if(l == r && l == a)
    {
        tree[node] -= val;
        return;
    }

    int m = (l + r) / 2;

    if(a <= m)
    update(2 * node, l, m, a, val);
    else
    update(2 * node + 1, m + 1, r, a, val);

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

void query(int node, int l, int r, int a, int b)
{
    if(l >= a && r <= b)
    {
        q_ans += tree[node];
        return;
    }

    int m = (l + r) / 2;

    if(a <= m)
    {
        query(2 * node, l, m, a, b);
    }

    if(b > m)
    {
        query(2 * node + 1, m + 1, r, a, b);
    }
}

int main()
{
    in >> n >> m;

    build(1, 1, n);

    for(int i = 1; i <= m; ++i)
    {
        in >> q >> a >> b;

        if(q == 0)
        {
            update(1, 1, n, a, b);
            continue;
        }

        if(q == 1)
        {
            q_ans = 0;

            query(1, 1, n, a, b);

            out << q_ans << '\n';
        }
    }

    return 0;
}