19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

#include <fstream>
#include <iostream>

using namespace std;

int main()
{
	ifstream f("datorii.in");
	ofstream g("datorii.out");
	int N, T, V, P, Q, i, j, M, sum, A[15000];
	//long M, sum;
	bool tf;

	f >> N >> M;

	//int* A = new int[N];

	for (i = 1; i <= N; i++)
		f >> A[i];

	for (j = 1; j <= M; j++)
	{
		f >> tf;
		if (tf == true)
		{
			f >> P >> Q;
			sum = 0;
			for (i = P; i <= Q; i++)
				sum += A[i];
			g << sum << endl;
		}
		else
		{
			f >> T >> V;
			A[T] -= V;
		}
	}
	f.close();
	g.close();
	return 0;
}