#ifdef ONLINE_JUDGE
	#include <bits/stdc++.h>
#else
	#include <algorithm>
	#include <bitset>
	#include <cassert>
	#include <cmath>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <iostream>
	#include <map>
	#include <set>
	#include <stack>
	#include <string>
	#include <utility>
	#include <vector>
	#include <queue>
	#include <climits>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');
#define BIT_STEP(pos) (pos ^ (pos & (pos - 1)))

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int N, Q;
vector <int> bit;

void UpdateBIT(vector <int> &bit, int pos, int N, int val) {
	for (; pos <= N; pos += BIT_STEP(pos)) {
		bit[pos] += val;
	}
}

int QueryBIT(vector <int> &bit, int pos) {
	int ans = 0;
	for (; pos; pos -= BIT_STEP(pos)) {
		ans += bit[pos];
	}
	return ans;
}

int main(){
	string file_input = "aib";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, pos, val, lend, rend, pw, ans, aux, t;
	
	ReadNo(N); ReadNo(Q);
	bit.resize(N + 1);
	for (i = 1; i <= N; ++i) {
		ReadNo(val);
		UpdateBIT(bit, i, N, val);
	}
	
	for (pw = 1; pw <= N; pw <<= 1);
	
	for (i = 0; i < Q; ++i) {
		ReadNo(t);
		if (t == 0) {
			ReadNo(pos); ReadNo(val);
			UpdateBIT(bit, pos, N, val);
		}
		else if (t == 1) {
			ReadNo(lend); ReadNo(rend);
			printf("%d\n", QueryBIT(bit, rend) - QueryBIT(bit, lend - 1));
		}
		else {
			ReadNo(val);
			for (ans = 0, pos = pw; pos; pos >>= 1) {
				aux = ans + pos;
				if (aux <= N) {
					if (QueryBIT(bit, aux) < val) {
						ans = aux;
					}
				}
			}
			if (ans + 1 <= N && QueryBIT(bit, ans + 1) == val) {
				printf("%d\n", ans + 1);
			}
			else {
				printf("-1\n");
			}
		}
	}
	
	return 0;
}