#include <bits/stdc++.h>


using namespace std;

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

const int NMAX = 15005;
int n, m, c, v[NMAX];

void update(int i, int x)
{
	for (i; i < n + 1; i += (i ^ (i - 1)) & i)
		v[i] += x;
}
int sum(int i)
{
	int s = 0;
	for (i; i; i -= (i ^ (i - 1)) & i)
		s += v[i];
	return s;
}
int main()
{
	int a, b;
	fin >> n >> m;
	for (int i = 1; i <= n; i++) {
		fin >> a;
		update(i, a);
	}
	for (int i = 1; i <= m; i++) {
		fin >> c >> a >> b;
		if (c == 0)
			update(a, (-1) * b);
		else
			fout << sum(b) - sum(a - 1) << '\n';
	}
	return 0;
}