//metoda naiva => modificare O(1), interogare O(n)
//metoda vector de sume => modificare O(n), interogate O(1)
// => pt interogari rapide + meodificari in timp real = arbori indexati binar => O(m*log(n))

#include "stdio.h"
#include "math.h"
#include <cstdlib>
using namespace std;

int N, M;
int *aib;

int mystery(int x){
	return x & (x -1) ^ x;
}

void update(int index, int value){
	for (int i = index; i <= N + 1; i += mystery(i))
		aib[i] -= value;
}

int query(int index){
	int sum = 0;
	for (int i = index; i > 0; i -= mystery(i))
		sum += aib[i];
	return sum;
}


int main(){

	FILE *in = fopen("datorii.in", "r");
	FILE *out = fopen("datorii.out", "w");

	fscanf(in, "%d %d", &N, &M);	
	aib = (int*)calloc(N + 1, sizeof(int));

	for (int i = 1, x; i < N + 1; ++i){
		fscanf(in, "%d", &x);
		update(i, -x);
	}

	for (int i = 0, cod, a, b; i < M; ++i){
		fscanf(in, "%d %d %d", &cod, &a, &b);
		if (cod == 0) update(a, b);
		else fprintf(out, "%d\n", query(b)- query(a-1));
	}

	fclose(in);
	fclose(out);	
	return 0;
}