#include<cstdio>
using namespace std;
int a[15005],n,aib[15004];
int lsb(int x)
{
	return ((x^(x-1))+1)>>1;
}

void update(int pos,int val)
{
	for(int i=pos;i<=n;i+=lsb(i))
		aib[i]+=val;
}

int query(int pos)
{
	int ans=0;
	while(pos)
	{
		ans+=aib[pos];
		pos-=lsb(pos);
	}
	return ans;
}
int main()
{

	freopen("datorii.in","r",stdin);
	freopen("datorii.out","w",stdout);
	int m,i,val,a1,b1,rez;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
			{
			scanf("%d",&val);
			update(i,val);
			}
	for(i=1;i<=m;i++)
		{
			scanf("%d%d%d",&val,&a1,&b1);
			if(val==0)
					update(a1,-b1);
			else
					printf("%d\n",query(b1)-query(a1-1));
		}

	return 0;
}