#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
const ll mod = 1e9+7;
ll n, k, m, mi, ma;

vector<ll> t(1e5 + 5, 0);

ll get(ll x){
	ll ans = 0;
	ll f = x;
	while(f){
		ans += t[f];
		f = f&(f - 1);
	}
	return ans;
}

void update(ll x, ll d){
	ll f = x;
	while(f <= n){
		t[f] += d;
		f = f|(f - 1);
		f++;
	}
}


void solve(){
	
	ifstream cin("aib.in");
	ofstream cout("aib.out");
	
	cin >> n >> m;
	for(int i = 0; i<n; i++){
		cin >> k;
		update(i + 1, k);
	}
	ll c, x, y;
	for(int i = 0; i<m; i++){
		cin >> c >> x;
		if(c == 0){
			cin >> y;
			update(x, y);
			continue;
		}
		if(c == 1){
			cin >> y;
			cout << get(y) - get(x - 1) << "\n";
			continue;
		}
		ll l = 1, r = n;
		if(x == 0){
			cout << "0\n";
			continue;
		}
		mi = n + 100;
		while(l <= r){
			ll mid = (l + r)/2;
			ll h = get(mid);
			if(h < x){
				l = mid + 1;
				continue;
			}
			if(h > x){
				r = mid - 1;
				continue;
			}
			mi = min(mid, mi);
			r = mid - 1;
		}
		if(mi == n + 100) mi = -1;
		cout << mi << "\n";
	}
	//for(int i = 1; i<=n; i++) cout << get(i) - get(i - 1) << " "; cout << "\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t=1;
	//cin >> t;
	while(t--) solve();
	
	return 0;
}