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

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

int N, M,i,a,b,j,op;
int v[15001];
int main()
{
	in >> N >> M;
	for (i = 1;i <= N;++i)
		in >> v[i];
	for (i = 1;i <= M;++i)
	{
		in >> op >> a >> b;

		if (op == 1)
		{
			int nr = 0;
			for (j = a;j <= b;++j)
				nr += v[j];
			out << nr << '\n';
		}
		else
		{
			v[a] -= b;
		}

	}
	return 0;
}