#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <fstream>
using namespace std;

class BIT {

public:

	vector<int> arr;
	int size;
	int max_stepsize;

	BIT(int n) {
		arr.resize(n+1);	// we start at index 1 .. n
		size = arr.size();

		max_stepsize = 1;
		while (max_stepsize < size) {
			max_stepsize <<= 1;
		}
	}


	void update (int i, int delta) {
		for (; i < size; i += (i & (-i))) {
			arr[i] += delta;
		}
	}

	// computes prefix sum at [1 .. i]
	int prefix_sum (int i) {
		int sum = 0;
		for (; i>0; i -= (i & (-i))) {
			sum += arr[i];
		}
		return sum;
	}

	// computes range sum at [i .. j]
	int range_sum (int& i, int& j) {
		return prefix_sum(j) - prefix_sum(i-1);
	}

	int min_k (int a) {
		// we need to do the binary search directly on the bit.
		int k = 0;
		int j;
		for (int step_size = max_stepsize; step_size > 0; step_size >>= 1) {
			j = k+step_size;
			if (j < size && arr[j] <= a) {
				a -= arr[j];
				k += step_size;

				if (a == 0) {
					return k;
				}
			}
		}
		return -1;
	}
};


int main () {

	ifstream fin ("aib.in");
	ofstream fout ("aib.out");

	int n,m;
	fin >> n >> m;
	BIT bit(n);
	int val, c, a, b;
	for (int i=1; i<=n; ++i) {
		fin >> val;
		bit.update(i, val);
	}

	for (int i=0; i<m; ++i) {
		fin >> c;
		switch (c) {
			case 0:
				fin >> a >> b;
				bit.update(a,b);
				break;
			case 1:
				fin >> a >> b;
				fout << bit.range_sum(a,b) << "\n";
				break;
			case 2:
				fin >> a;
				fout << bit.min_k(a) << "\n";
				break;
		}
	}

	return 0;
}