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

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll nmax=100000;
#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[nmax*4],a[nmax],sum=0;

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

int querry(int v, int tl, int tr, int a, int add) {
	if (add==a || tl==tr) {
		return tr;
	}
	else {
		int tm=(tl+tr)/2;
		add+=t[v*2];
		if (add<a) {
			querry(v*2+1,tm+1,tr,a,add); 
		}
		else if (add>a){
			add-=t[v*2];
			querry(v*2,tl,tm,a,add);
		}
		else if (add==a) {
			return tm;
		}
	}
}

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

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ifstream cin("aib.in");
	ofstream cout("aib.out");
	ll n,m;
	cin >> n >> m;
	for (int i=1; i<=n; i++) {
		cin >> a[i];
	}
	create(1,1,n);
	while (m--) {
		ll x;
		cin >> x;
		int a,b;
		if (x==0) {
			cin >> a >> b;
			addition(1,1,n,a,b);
		}	
		else if (x==1) {
			cin >> a >> b;
			cout << sumQuerry(1,1,n,a,b) << '\n';
		}
		else if (x==2) {
			cin >> a;
			cout << querry(1,1,n,a,0) << '\n';
		}
	}

}