// Problema Datorii -> Infoarena
#include <fstream>
#include <vector>
using namespace std;

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

vector<int> Tree; // interval tree

int n, m;
int T, a, b; // for Query

void Build(int, int, int);
void Update(int, int , int , int, int);
int Query(int, int, int, int, int);

int main()
{
	fin >> n >> m;
	Tree.resize(4 * n);
	Build(1, 1, n);
	
	for (;m ; m--)
	{
		fin >> T >> a >> b;
		if (T == 0)
			Update(1, 1, n, a, b);
		else
			fout << Query(1, 1, n, a, b) << '\n';
	}

	return 0;
}

int Query(int node, int left, int right, int start, int end)
{
	if (start <= left && right <= end)
		return Tree[node];
	
	auto mid = (left + right) / 2;
	
	int Sum = 0;
	if (start <= mid)
		Sum += Query(2 * node, left, mid, start, end);
	if (mid < end)
		Sum += Query(2 * node + 1, mid + 1, right, start, end);
		
	return Sum;
}

void Update(int node, int left, int right, int pos, int val)
{
	if (left == right)
	{
		Tree[node] = Tree[node] - val; // se achita suma "val" dintr-o datorie
		return;
	}
	
	auto mid = (left + right) / 2;
	
	if (pos <= mid)
		Update(2 * node, left, mid, pos, val);
	else
		Update(2 * node + 1, mid + 1, right, pos, val);
	
	Tree[node] = Tree[2 * node] + Tree[2 * node + 1];
}

void Build(int node, int left, int right)
{
	if (left == right)
	{
		fin >> Tree[node];
		return;
	}
	
	auto mid = (left + right) / 2;
	
	Build(2 * node, left, mid);
	Build(2 * node + 1, mid + 1, right);
	
	Tree[node] = Tree[2 * node] + Tree[2 * node + 1];	
}