#include<stdio.h>
#include<iostream> 
#include<string.h> 
#define nmax 15001
using namespace std; 
int n,m,i,S,C,ARB[nmax]; 
	void Update(int poz,int val)
{
C=0;
while(poz<=n)
{
ARB[poz]+=val;
while(!(poz&1<<C)) C++;
poz+=(1<<C);
C+=1;
}
}
	int Query(int poz)
{
C=0,S=0;
while(poz>0)
{
	S+=ARB[poz];
	while(!(poz&(1<<C))) C++;
	poz-=(1<<C);
	C+=1;
}
return S;
}
	
	int main() 
{
int val,cod,x,y;	
freopen("datorii.in","r",stdin); 
freopen("datorii.out","w",stdout); 
scanf("%d%d",&n,&m); 
for(i=1;i<=n;i++) 
{
scanf("%d",&val);
Update(i,val);
}
for(;m;m--)
{
scanf("%d%d%d",&cod,&x,&y);
if(!cod)
{	
	y*=-1;
	Update(x,y);
}
else
printf("%d\n",Query(y)-Query(x-1));
}
return 0;
}