#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif

#include <stdio.h>
#include <stdlib.h>


int s[16][16384], n, l;


int log2(int n)
{
	int l = 0, p = 1;
	while (n > p)
	{
		p <<= 1;
		l++;
	}
	return l;
}


int sumast(int st, int dr)
{
	if (st > dr)
		return 0;

	if (st == dr)
		return s[0][st];

	int l = log2(dr - st + 1) - 1;
	int x = 1 << l;
	return s[l][dr / x] + sumast(st, dr / x * x - 1);
}


int sumadr(int st, int dr)
{
	if (st > dr)
		return 0;

	if (st == dr)
		return s[0][st];

	int l = log2(dr - st + 1) - 1;
	int x = 1 << l;
	return s[l][st / x] + sumadr((st / x + 1) * x, dr);
}


int suma(int s, int d)
{
	int x = 1 << (log2(d - s + 1) - 1);
	return sumast(s, x - 1) + sumadr(x, d);
}


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

	int m;
	scanf("%d%d", &n, &m);

	for (int i = 0; i < n; i++)
		scanf("%d", &s[0][i]);

	l = log2(n);
	for (int i = 1; i <= l; i++)
		for (int j = 0; j <= (n >> i); j++)
			s[i][j] = s[i - 1][j * 2] + s[i - 1][j * 2 + 1];

	for (int r = 0; r < m; r++)
	{
		int o, a, b;
		scanf("%d%d%d", &o, &a, &b);

		if (o == 0)
		{
			a--;
			for (int i = 0; i <= l; i++)
				s[i][a >> i] -= b;
		}
		else
		{
			printf("%d\n", suma(a - 1, b - 1));
		}
	}

	return 0;
}