#include <iostream>
#include <fstream>
using namespace std;

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

int v[15000], d[60000];

void creare(int nod, int st, int dr)
{
    if(st == dr)
    {
        d[nod] = a[st];
        return;
    }
    creare(nod * 2, st, (st + dr) / 2);
    creare(nod * 2 + 1, (st + dr) / 2 + 1, dr);
    d[nod] = d[nod * 2] + d[nod * 2 + 1];
}

void update(int nod, int st, int dr, int i, int val)
{
    if(i < st || i > dr)
        return;

    if(st == dr)
    {
        d[nod] -= val;
        return;
    }

    update(nod * 2, st, (st + dr) / 2, i, val);
    update(nod * 2 + 1, (st + dr) / 2 + 1, dr, i, val);
    d[nod] = d[nod * 2] + d[nod * 2 + 1];
}

int sum(int nod, int st, int dr, int i, int j)
{
    if(dr < i || st > j)
        return 0;

    if(i <= st && dr <= j)
        return d[nod];

    return sum(nod * 2, st, (st + dr) / 2, i, j) + sum (nod * 2 + 1, (st + dr) / 2 + 1, dr, i, j);
}

int main()
{
int n, m, x, y, z;

fin >> n >> m;
for(int i = 1; i <= n; i++)
    fin >> v[i];
creare(1, 1, n);

for(int i = 0; i < m; i++)
{
    fin >> z >> x >> y;
    if(z)
        fout << sum(1, 1, n, x, y) << "\n";
    else
        update(1, 1, n, x, y);
}

return 0;
}