#include <fstream>
#include <iostream>

using namespace std;

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

int tree[4000001];

void build (int n, int l, int r, int p, int val)
{
    if (l == r)
    {
        tree[n] = val;
        return;
    }
    int m = (l + r) / 2;
    if (p <= m)
        build(2 * n, l, m, p, val);
    else
        build(2 * n + 1, m + 1, r, p, val);
    tree[n] = tree[2 * n] + tree[2 * n + 1];
}

void update (int n, int l, int r, int p, int val)
{
    if (l == r)
    {
        tree[n] = tree[n] - val;
        return;
    }
    int m = (l + r) / 2;
    if (p <= m)
        update(2 * n, l, m, p, val);
    else
        update(2 * n + 1, m + 1, r, p, val);
    tree[n] = tree[2 * n] + tree[2 * n + 1];
}


int query (int n, int l, int r, int x, int y)
{
    if (l >= x && y >= r)
        return tree[n];
    int s, d;
    s = d = 0;
    int mijl = (l + r) / 2;
    if (x <= mijl)
        s = query(2 * n, l, mijl, x, y);
    if (y > mijl)
        d = query(2 * n + 1, mijl + 1, r, x, y);
    return s + d;
}

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

    for(int j = 1; j < 2 * n; j++)
        fout << tree[j] << ' ';
    fout << '\n';

    for(i = 1; i <= m; i++)
    {
        int opt;
        fin >> opt;
        if(opt == 1)
        {
            int x, y;
            fin >> x >> y;
            fout << query(1, 1, n, x, y) << '\n';
        }
        else
        {
            int x, y;
            fin >> x >> y;
            update(1, 1, n, x, y);
        }

    }
    return 0;
}