#include <stdio.h>
#define NMAX 15005
#define LMAX 1<<15
int n,m,arb[LMAX],x,y,a;
void update(int st,int dr,int nod,int val)
{
	if (st==dr)
	{
		arb[nod]+=val;
		return ;
	}
	int mij=(st+dr)/2;
	if (a<=mij)
		update(st,mij,nod*2,val);
	else
		update(mij+1,dr,nod*2+1,val);
	arb[nod]=arb[2*nod]+arb[2*nod+1];
}
int query(int st,int dr,int nod)
{
	if (x<=st && dr<=y)
		return arb[nod];
	if (x>dr || y<st)
		return 0;
	int mij=(st+dr)/2;
	return query(st,mij,2*nod)+query(mij+1,dr,2*nod+1);
}
int main()
{
	freopen("datorii.in","r",stdin);
	freopen("datorii.out","w",stdout);
	scanf("%d%d",&n,&m);
	int i,tip;
	for (i=1; i<=n; i++)
	{
		scanf("%d",&x);
		a=i;
		update(1,n,1,x);
	}
	while (m--)
	{
		scanf("%d%d%d",&tip,&x,&y);
		if (!tip)
		{
			a=x;
			update(1,n,1,-y);
		}
		else
			printf("%d\n",query(1,n,1));
	}
	return 0;
}