树状数组:点修改，然后区间查询和

#include<bits/stdc++.h>
using namespace std;
#define YES cout<<"YES"<<endl;
#define NO  cout<<"NO"<<endl;
#define endl '\n'
#define io ios::sync_with_stdio(false)
#define tie cin.tie(0),cout.tie(0)
#define mod 1000000007
#define pb push_back
#define rep(x,y) for(int i=x;i<y;i++)
#define pii pair<int,int>
const int maxn=5e5+10;
struct dsu{
	int fa[maxn],sz[maxn];
	void init(int n){
		for(int i=1;i<=n;i++){
			fa[i]=i;
			sz[i]=1;
		}
	}
	int f(int x){
		if(x!=fa[x]) return fa[x]=f(fa[x]);
		return fa[x];
	}
	void merge(int x,int y){
		int rootx=f(x);
		int rooty=f(y);
		if(rootx==rooty) return;
		if(sz[rootx]<sz[rooty]) swap(rootx,rooty);
		fa[rooty]=rootx;
		sz[rootx]+=sz[rooty];
	}
};
int gcd(int a,int b) {
    return (b==0) ? a : gcd(b,a%b);
}
int lcm(int a,int b) {
    return (a*b)/gcd(a,b);
}
int lowbit(int x){
	return x&-x;
}
void change(int x,int d,vector<int>&nums){//向后修
	while(x<=nums.size()-1){
		nums[x]+=d;
		x+=lowbit(x);
	}
}
int query(int x,vector<int>&nums){//前缀和
	int res=0;
	while(x){
		res+=nums[x];
		x-=lowbit(x);
	}
	return res;
}
void solve() {
	int n,m;
    cin>>n>>m;
    vector<int>nums(n+1);
    for(int i=1;i<=n;i++){
    	int x;cin>>x;
    	change(i,x,nums);
    };
    while(m--){
    	int t,a,b;cin>>t>>a>>b;
    	if(t==1){
    		change(a,b,nums);
    	}else{
    		int ans=query(b,nums)-query(a-1,nums);
    		cout<<ans<<endl;
    	}
    }
    
}
signed main() {
	
    io, tie;
    int w;
    //cin >>w;
    w=1;
    while(w--) solve();
    return 0;
}