#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("datorii.in");
ofstream fout("datorii.out");

int arb[100001];//?
int n, m;
int val[15001];

void update(int pos, int val, int left = 1, int right = n, int node = 1)
{
    if (left == right)
    {
        arb[node] = val;
        return;
    }

    int mid = (left + right) / 2;

    if (pos <= mid)
        update(pos, val, left, mid, 2 * node);
    else
        update(pos, val, mid + 1, right, 2 * node + 1);

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

int query(int x, int y, int node = 1, int left = 1, int right = n)
{
    if (left >= x && right <= y)
        return arb[node];

    int mid = (left + right) / 2;

    int al, ar;
    al = ar = 0;

    if (mid >= x)
        al = query(x, y, 2 * node, left, mid);
    if (mid < y)
        ar = query(x, y, 2 * node + 1, mid + 1, right);

    return al + ar;
}

int main()
{
    fin >> n >> m;
    for (int i=1; i<=n; i++)
    {
        int a;
        fin >> a;
        val[i] = a;
        update(i, val[i]);
    }

    for (int i=0; i<m; i++)
    {
        int x,a,b;
        fin>>x>>a>>b;
        if (x==0)
        {
            val[a] -= b;
            update(a, val[a]);
        }
        else
        {
            fout << query(a, b) << '\n';
        }
    }

    return 0;
}