#include<stdio.h>

int sume[40000],n,m,i,tip,a,b,x;

inline void refresh(int nod,int st,int dr,int pos,int val)
{
	if(st==pos&&dr==pos) sume[nod]+=val;
	else
	{
		int m=(st+dr)/2;
		
		if(pos<=m) refresh(2*nod,st,m,pos,val);
		else refresh(2*nod+1,m+1,dr,pos,val);
		
		sume[nod]=sume[2*nod]+sume[2*nod+1];
	}
}

inline int rest(int nod,int st,int dr,int a,int b)
{
	if(a<=st&&dr<=b) return sume[nod];
	else
	{
		int sum=0,m=(st+dr)/2;
		
		if(a<=m) sum+=rest(2*nod,st,m,a,b);
		if(b>m) sum+=rest(2*nod+1,m+1,dr,a,b);
		
		return sum;
	}
}

int main()
{
	freopen("datorii.in","r",stdin);
	freopen("datorii.out","w",stdout);
	
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		refresh(1,1,n,i,x);
	}
	for(i=0;i<m;i++)
	{
		scanf("%d%d%d",&tip,&a,&b);
		switch(tip)
		{
			case 0:
				refresh(1,1,n,a,-b);
				break;
			case 1:
				printf("%d\n",rest(1,1,n,a,b));
				break;
		}
	}
	
	return 0;
}