#include<stdio.h>
#include<fstream>
#include <assert.h>

#define Dim 15001

int ArbDat[4 * Dim], start, finish, N, M,Val,Pos,sum;


void Update(int nod, int left, int right);

void Query(int nod, int left, int right);

int main()
{
	int i,x, a, b;
	freopen("datorii.in", "r", stdin);
	freopen("datorii.out", "w", stdout);

	scanf("%d%d", &N, &M);

	for (i = 1; i <= N; ++i)
	{
		scanf("%d", &x);
		Pos = i;
		Val = x;
		Update(1, 1, N);
	}

	for (i = 1; i <= M; ++i)
	{
		scanf("%d%d%d", &x, &a, &b);
		if (x == 1)
		{//querry
			start = a;
			finish = b;
			sum = 0;
			Query(1, 1, N);
			printf("%d\n", sum);
		}
		else {//update
			Pos = a, Val = -1 * b;
			Update(1, 1, N);
		}
	}

	return 0;
}

void Update(int nod, int left, int right)
{
	if (left == right)
	{
		ArbDat[nod] += Val;
		return;
	}

	int div = (left + right) / 2;
	if (Pos <= div) Update(2 * nod, left, div);
	else Update(2 * nod + 1, div + 1, right);

	ArbDat[nod] = ArbDat[2 * nod] + ArbDat[2 * nod + 1];
}

void Query(int nod, int left, int right)
{
	if (start <= left && right <= finish)
	{
		sum += ArbDat[nod];
		return;
	}

	int div = (left + right) / 2;

	if (start <= div) Query(nod * 2, left, div);
	if (div < finish)	Query(2 * nod + 1, div + 1, right);

}