#include <bits/stdc++.h>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int NMAX = 15000;
int n, m;
int aint[3 * NMAX];
int val;
int poz;
int ans;

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

    int m = (r + l) / 2;

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

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

void update(int node, int l, int r)
{
    if(l == r)
    {
        aint[node] -= val;
        return;
    }
    int m = (r + l) / 2;

    if(poz <= m)
    {
        update(2 * node, l, m);
    }
    else
    {
        update(2 * node + 1, m + 1, r);
    }

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

void querry(int node, int x, int y, int l, int r)
{
    if(x <= l && y >= r)
    {
        ans += aint[node];
        return;
    }

    int m = (l + r) / 2;

    if(x <= m)
    {
        querry(2 * node, x, y, l, m);
    }

    if(y > m)
    {
        querry(2 * node + 1, x, y, m + 1, r);
    }
}

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

    build(1, 1, n);

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

        if(c)
        {
            in >> a >> b;
            querry(1, a, b, 1, n);
            out << ans << '\n';
            ans = 0;
        }
        else
        {
            in >> poz >> val;
            update(1, 1, n);
        }
    }
    return 0;
}