#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define st first
#define nd second
#define pb push_back
#define nleft (n<<1)
#define nright (nleft+1)

#include<vector>

using namespace std;
#include<fstream>
ifstream fin("datorii.in");
ofstream fout("datorii.out");

#include<string.h>

#define NMAX 15005

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

class ArbInt
{
	public:
	int Arb[NMAX<<2];
	int Pos, Val;
	int N;
	int A,B,Suma;
	
	void Initiate()
	{
		memset(Arb, 0, sizeof(Arb));
	}
	
	void Update(int p, int v)
	{
		Pos=p;
		Val=v;
		_update(1,1,N);
	}
	
	int Query(int a, int b)
	{
		A=a; B=b; Suma=0;
		//fout<<"Query: A="<<A<<"B="<<B<<"\n";
		_query(1,1,N);
		return Suma;
	}
	
	void _update(int n, int left, int right)
	{
		if(left==right){
			Arb[n]+=Val; return;
		}
		
		int pivot=(left+right)>>1;
		
		if(Pos<=pivot)
			_update(nleft, left, pivot);
		else
			_update(nright, pivot+1, right);
		Arb[n] = Arb[nright] + Arb[nleft];
		//fout<<Arb[n]<<", ";
	}
	
	void _query(int n, int left, int right)
	{
		//fout<<"left: "<<left<<"right: "<<right<<"\n";
		if(A <= left && right <= B)
		{
			Suma+=Arb[n];
			return;
		}
		int pivot=(left+right)>>1;
		if(A<=pivot) _query(nleft, left, pivot);
		if(pivot<B) _query(nright, pivot+1, right);
	}	
};

int i,n,m,x,y,a;

int main()
{
	ArbInt A;
	fin>>n>>m;
	A.N=n;
	
	A.Initiate();
	
	REP(i,n)
	{
		fin>>x;
		A.Update(i+1, x);
	}
	
	while(m--)
	{
		fin>>a;
		fin>>x>>y;
		if(a==0)
		{
			A.Update(x,-y);
		}
		else
		{
			fout<<A.Query(x,y)<<endl;
		}
	}
	
	return 0;
}