//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); // build the initial tree
	
	for (; M; M--){
		fin >> T >> a >> b;
		
		if (T == 0)
			Update(1, 1, N, a, b); // Tree[a] -= b
		else
			if(T == 1)
				fout << Query(1, 1, N, a, b) << '\n'; // Tree[a] + ... + Tree[b]
	}
	
	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] -= val;
		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];
}

// Geany IDE / Linux