#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;
const ll INF=1e7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;

ll t[4*INF];

void buildSegTree(int a[], int v, int tl, int tr) {
	if (tl==tr) {
		t[v]=a[tl];
	}
	else {
		int tm=(tl+tr)/2;
		buildSegTree(a,2*v,tl,tm);
		buildSegTree(a,2*v+1,tm+1,tr);
		t[v]=t[v*2]+t[v*2+1];
	}
}

void updateQuerry(int v, int tl, int tr, int pos, int scadere) {
	if (tl==tr) {
		t[v]=t[v]-scadere;
		return;
	}
	else {
		int tm=(tl+tr)/2;
		if (pos<=tm) {
			updateQuerry(2*v, tl, tm, pos, scadere);
		}
		else {
			updateQuerry(2*v+1, tm+1, tr, pos, scadere);
		}
		t[v]=t[v*2]+t[v*2+1];
	}
}

int sumQuerry(int v, int tl, int tr, int l, int r) {
	if(tl>r || tr<l)
		return 0;
	if (l<=tl && r>=tr) {
		return t[v];
	}
	else {
		int tm=(tl+tr)/2;
		return sumQuerry(2*v,tl,tm,l,r)+sumQuerry(2*v+1,tm+1,tr,l,r);
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ifstream cin("datorii.in");
	ofstream cout("datorii.out");
	int n,m;
	cin >> n >> m;
	int arr[n+5];
	for (int i=1; i<=n; i++) {
		cin >> arr[i];
	}
	buildSegTree(arr,1,1,n);
	int x,a,b;
	while (m--) {
		cin >> x;
		if (x==0) {
			cin >> a >> b;
			updateQuerry(1,1,n,a,b);
		}	
		else if (x==1) {
			cin >> a >> b;
			cout << sumQuerry(1,1,n,a,b) << '\n';
		}	
	}

}