#include <cstdio>
using namespace std;

const int H = 17;
const int N = 1 << H;
int BIT[N + 1];

inline int next_int() {
	int d;
	scanf("%d", &d);
	return d;
}

int get(int index) {
	int sum = 0;
	while (index) {
		sum += BIT[index];
		index -= index & -index;
	}
	return sum;
}

void add(int index, int value) {
	while (index <= N) {
		BIT[index] += value;
		index += index & -index;
	}
}

int find(int sum) {
	int lo = 0, hi = N;
	while (hi - lo > 1) {
		int mid = (lo + hi) / 2;
		if (get(mid) < sum) {
			lo = mid;
		} else {
			hi = mid;
		}
	}
	return get(hi) == sum ? hi : -1;
}

int main() {
	freopen("aib.in", "r", stdin);
	freopen("aib.out", "w", stdout);
	int n = next_int();
	int m = next_int();
	for (int i = 1; i <= n; i++) {
		add(i, next_int());
	}
	for (int i = 0; i < m; i++) {
		int q = next_int();
		if (q == 0) {
			int a = next_int();
			int b = next_int();
			add(a, b);
		}
		if (q == 1) {
			int a = next_int();
			int b = next_int();
			printf("%d\n", get(b) - get(a - 1));
		}
		if (q == 2) {
			int a = next_int();
			printf("%d\n", find(a));
		}
	}
	return 0;
}