#include<fstream>
using namespace std;
int n,m,arb[4*15005+66],i,val,pos,x,start,finish,zi,a,b;
long sum;
void update(int nod, int left, int right)
{
	if(left==right)
	{
		arb[nod]=val;
		return;
	}
	int div=(left+right)/2;
	if(pos<=div)
		update(2*nod,left,div);
	else
		update(2*nod+1,div+1,right);
	arb[nod]=arb[2*nod]+arb[2*nod+1];
}
void query(int nod,int left, int right)
{
	if(start<=left && finish>=right)
	{
		sum+=arb[nod];
		return;
	}
	int div=(left+right)/2;
	if(start<=div)
		query(2*nod,left,div);
	if(finish>div)
		query(2*nod+1,div+1,right);
}
void update_2(int nod, int left, int right)
{
	if(left==right)
	{
		arb[nod]-=val;
		return;
	}
	int div=(left+right)/2;
	if(zi<=div)
		update(2*nod,left,div);
	else update(2*nod+1,div+1,right);
	arb[nod]-=val;
}
int main()
{
	ifstream fin("datorii.in");
	fin>>n>>m;
	for(i=1;i<=n;i++)
	{
		fin>>val;
		pos=i;
		update(1,1,n);
	}
	ofstream fout("datorii.out");
	for(i=1;i<=m;i++)
	{
		fin>>x>>a>>b;
		if(x==1)
		{
			sum=0;
			start=a;
			finish=b;
			query(1,1,n);
			fout<<sum<<'\n';
		}
	   if(x==0)
	   {
		   zi=a;
		   val=b;
		   update_2(1,1,n);
	   }
	}
  fin.close();
  fout.close();
  return 0;
}