#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,i,v,a,b,A[400010],sol;
void build(int nod,int st,int dr) {
	if (st==dr) {
		fin>>A[nod];
		return;
	}
	int mid=(st+dr)/2;
	build(2*nod,st,mid);
	build(2*nod+1,mid+1,dr);
	A[nod]=A[2*nod]+A[2*nod+1];
}
void update(int nod,int st,int dr,int p,int x) {
	if (st==dr) {
		A[nod]-=x;
		return;
	}
	int mid=(st+dr)/2;
	if (p<=mid)
		update(2*nod,st,mid,p,x);
	else
		update(2*nod+1,mid+1,dr,p,x);
	A[nod]=A[2*nod]+A[2*nod+1];
}
void query(int nod,int st,int dr,int a,int b) {
	if (a<=st&&dr<=b) {
		sol+=A[nod];
		return;
	}
	int mid=(st+dr)/2;
	if (a<=mid)
		query(2*nod,st,mid,a,b);
	if (b>mid)
		query(2*nod+1,mid+1,dr,a,b);
}
int main() {
	fin>>n>>m;
	build(1,1,n);
	for (i=1;i<=m;i++) {
		fin>>v>>a>>b;
		if (v==0)
			update(1,1,n,a,b);
		else {
			sol=0;
			query(1,1,n,a,b);
			fout<<sol<<"\n";
		}
	}
	return 0;
}