#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif

#include <stdio.h>


int s[20][16384];


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


int suma(int a, int b, int n)
{
	if (a > b)
		return 0;

	if (a == b)
		return s[0][a];

	int c = (b >> n) << n;
	if (a == c && a + (1 << n) - 1 == b)
		return s[n][a >> n];

	c = (b >> n) << n;
	n--;
	if (a < c)
		return suma(a, c - 1, n) + suma(c, b, n);
	else
		return suma(a, b, n);
}


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

	int n, m, l, i, j, o, a, b;
	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		scanf("%d", &s[0][i]);

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

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

		if (o == 0)
		{
			a--;
			for (j = 0; j <= l; j++)
				s[j][a >> j] -= b;
		}
		else
		{
			a--;
			b--;

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

	return 0;
}