#include <fstream>
#define InFile  "datorii.in"
#define OutFile "datorii.out"
#define MAX 100001

using namespace std;

int sum1 (int position);
void sum2 (int position, int value);

unsigned short int N;
unsigned int M;
int A[MAX];
bool type;
unsigned int T, V, P, Q;

int tree[MAX];
unsigned int i, j;

unsigned int sum;

int main ()
{
    ifstream fin (InFile);
    ofstream fout (OutFile);
    fin >> N >> M;
    for (i=1; i<=N; i++)
    {
        fin >> A[i];
        sum2(i,A[i]);
    }
    for (i=1; i<=M; i++)
    {
        fin >> type;
        if (type == 0)
        {
            fin >> T >> V;
            /// BUG
            for (j=T; j<=N; j++)
                tree[j] = 0;
            A[T] -= V;
            for (j=T-2; j<=N; j++)
                sum2(j,A[j]);
        }
        else
        {
            fin >> P >> Q;
            sum = sum1(Q) - sum1(P-1);
            fout << sum << '\n';
        }
    }
    fin.close();
    fout.close();
    return 0;
}

int sum1 (int position)
{
    int sum=0;
    while (position > 0)
    {
        sum += tree[position];
        position -= (position^(position-1)) & position;
    }
    return sum;
}

void sum2 (int position, int value)
{
    while (position <= N)
    {
        tree[position] += value;
        position += (position^(position-1)) & position;
    }
}