#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 15007;

int arb[DIM * 4];

void update(int pos, int l, int r, int x, int val)
{
	if(l == r)
	{
		arb[pos] += val;
		return ;
	}
	
	int mid = (l + r) / 2;
	
	if(x <= mid)
		update(pos * 2, l, mid, x, val);
	else
		update(pos * 2 + 1, mid + 1, r, x, val);
	
	arb[pos] = arb[pos * 2] + arb[pos * 2 + 1];
}

int query(int pos, int l, int r, int x, int y)
{
	if(x <= l && r <= y)
	{
		return arb[pos];
	}
	
	int sum = 0;
	
	int mid = (l + r) / 2;
	
	if(x <= mid)
		sum += query(pos * 2, l, mid, x, y);
	
	if(y > mid)
		sum += query(pos * 2 + 1, mid + 1, r, x, y);
	
	return sum;
}

main()
{
	int n, m;
	fin >> n >> m;
	
	for(int i = 1; i <= n; i++)
	{
		int x;
		fin >> x;
		
		update(1, 1, n, i, x);
	}
	
	while(m--)
	{
		int op, a, b;
		fin >> op >> a >> b;
		
		if(op == 0)
		{
			update(1, 1, n, a, -b);
		}
		else
		{
			fout << query(1, 1, n, a, b) << '\n';
		}
	}
}