#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include <algorithm>
#define zeros(x) ( (x ^ (x - 1)) & x )//nr de zero terminale
using namespace std;


int n, m;
int v[15001], AIB[15001];

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

void Add(int x, int quantity)
{
	//adauga pozitiei x o cantitate
	int i;
	for (i = x; i <= n; i += zeros(i))
		AIB[i] += quantity;
}

int Compute(int x)
{
	//returneaza cantitatea ramasa in pozitia x
	int i, ret = 0;
	for (i = x; i > 0; i -= zeros(i))
		ret += AIB[i];
	return ret;
}

int main()
{
	fin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		int x;
		fin >> x;
		Add(i, x);
	}
	for (int i = 1; i <= m; i++)
	{
		int op, x, y;
		fin >> op >> x >> y;
		if (op == 0)
		{
			Add(x, -y);
		}
		else {
			fout << Compute(y) - Compute(x - 1) << "\n";
		}
	}
	return 0;
}