#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;

//```
#define ONLINE_JUDGE

const string file = "aib";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)

int N, M;
vi aib;

void add(int poz, int val) {
	for (;poz <= N; poz += zeroes(poz)) {
		aib[poz] += val;
	}
}

int get(int poz) {
	int res = 0;
	for (;poz; poz -= zeroes(poz)) {
		res += aib[poz];
	}
	return res;
}

int comp(int sum) {
	int pos = 0, step = 1;
	
	while (step <= N) {
		step <<= 1;
	}
	step >>= 1;

	for(; step; step >>= 1) {
		if (pos + step <= N) {
			if (sum >= aib[pos + step]) {
				pos += step;
				sum -= aib[pos];
				if (sum == 0) {
					return pos;
				}
			}
		}
	}

	
	
	return -1;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	int i, c, x;

	scanf("%d %d", &N, &M);
	aib.resize(N + 1);

	for (i = 1; i <= N; ++i) {
		scanf("%d", &x);
		add(i, x);
	}
	
	for (i = 0; i < M; ++i) {
		scanf("%d", &c);
		if (c == 0) {
			int poz, val;
			scanf("%d %d", &poz, &val);
			add(poz, val);
		}
		else if (c == 1) {
			int a, b;
			scanf("%d %d", &a, &b);
			printf("%d\n", get(b) - get(a - 1));
		}
		else {
			int sum;
			scanf("%d", &sum);
			printf("%d\n", comp(sum));
		}
	}

	return 0;
}