#include <stdio.h>
#define N 15050
int n,m;
int v[N],c[N],s[N];
void read()
{
	scanf("%d %d\n",&n,&m);
	int i,nr,t,salv;
	for (i=1; i<=n; i++)
	{
		scanf("%d",&v[i]);
		s[i]=s[i-1]+v[i];
	}
	for (i=1; i<=n; i++)
	{
		nr=0;
		salv=i;
		while (salv%2==0)
		{
			nr++;
			salv/=2;
		}
		t=i-(1<<nr)+1;
		c[i]=s[i]-s[t-1];
	}
}
void solve()
{
	int i,tip,ind,val,poz,st,dr,s1,s2,salv;
	for (i=1; i<=m; i++)
	{
		scanf("%d",&tip);
		if (tip==0)
		{
			scanf("%d%d",&ind,&val);
			poz=0;
			while (ind<=n)
			{
				c[ind]=c[ind]-val;
				salv=ind;
				while (salv % 2==0)
				{
					poz++;
					salv/=2;
				}
				ind=ind+(1<<poz);
				poz++;
			}
		}
		else
		{
			scanf("%d%d",&st,&dr);
			s1=0;
			poz=0;
			while (dr>0)
			{
				s1=s1+c[dr];
				salv=dr;
				while (salv % 2==0)
				{
					poz++;
					salv/=2;
				}
				dr=dr-(1<<poz);
				poz++;
			}
			st--;
			s2=0;
			poz=0;
			while (st>0)
			{
				s2=s2+c[st];
				salv=st;
				while (salv % 2==0)
				{
					poz++;
					salv/=2;
				}
				st=st-(1<<poz);
				poz++;
			}
			printf("%d\n",s1-s2);
		}
	}
}
int main()
{
	freopen("datorii.in","r",stdin);
	freopen("datorii.out","w",stdout);
	read();
	solve();
	return 0;
}