#include<iostream>
using namespace std;
int n,m,k,v,a,b,c[600005];
int lowbit(int x){return x&(-x);}
void update(int x,int v){
	while(x<=n){
		c[x]+=v;
		x+=lowbit(x);
	}
}
int sum(int x){
	int res=0;
	while(x>0){
		res+=c[x];
		x-=lowbit(x);
	}
	return res;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		cin>>v;
		update(i,v);
	}
	while(m--){
		cin>>k>>a>>b;
		if(k==2) cout<<sum(b)-sum(a-1)<<endl;
		else update(a,b);
	}
return 0;
}

大佬指点，只有70！！！