#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 15000;
int arbore[5 * N];

void update(int nod, int left, int right, int pos, int val) {
	if (left == right) {
		arbore[nod] += val;
		return;
	}
	int mij = (left + right) / 2;
	if (pos <= mij) update(2 * nod, left, mij, pos, val);
	else update(2 * nod + 1, mij + 1, right, pos, val);
	arbore[nod] = arbore[2 * nod] + arbore[2 * nod + 1];
}

int query(int nod, int left, int right, int a, int b) {
	if (a <= left && right <= b) return arbore[nod];
	int mij = (left + right) / 2, sum = 0;
	if (a <= mij) sum += query(2 * nod, left, mij, a, b);
	if (mij < b) sum += query(2 * nod + 1, mij + 1, right, a, b);
	return sum;
}

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