#include <fstream>
using namespace std;
#define nmax 1000000
using namespace std;
int s, ps[nmax], n, in;

inline int kk(int nr,int z) {
	int k;
	k = z;
	while (!(nr & (1 << k))) {
		k++;
	}
	return k;
}

inline int clef(int i) {
	return i - (1 << kk(i,0)) + 1;
}

inline int update(int pos, int val) {
	// a[pos] += val;
	int z;
	z=0;
	ps[pos] += val;
	while (pos <= n) {
		pos += (1 << kk(pos,z));
		ps[pos] += val;
		z++;
	}
	return 0;
}

inline int sum(int pos) {
	int s = 0;
	if (pos == 0) {
		return 0;
	}
	s += ps[pos];
	while (pos >= 1) {

		if (clef(pos) == 1) {
			break;
		}
		pos -= (1 << kk(pos,0));
		s += ps[pos];

	}
	return s;
}

inline int inter(int a, int b) {
	int x, y;
	x = sum(b);
	y = sum(a - 1);
	return x - y;
}

inline int bsearch(int sm) {
	int l, r, x, st;
	l = 1;
	r = n;
	while (l <= r) {
		x = (l + r) / 2;
		st = sum(x);
		if (st == sm) {
			return x;
		}
		if (st > sm) {
			r = x - 1;
			continue;
		}
		if (st < sm) {
			l = x + 1;
			continue;
		}
	}
	return -1;
}

int main() {
	int temp, t1, t2;
	ifstream fin("aib.in");
	ofstream fout("aib.out");
	fin >> n >> in;

	for (int i = 1; i <= n; i++) {
		fin >> temp;
		// ps[i] = pars(i);
		update(i, temp);
	}

	for (int i = 1; i <= in; i++) {
		fin >> temp;
		if (temp == 0) {
			fin >> t1 >> t2;
			update(t1, t2);
		}
		if (temp == 1) {
			fin >> t1 >> t2;
			fout << inter(t1, t2) << "\n";
		}
		if (temp == 2) {
			fin >> t1;
			fout << bsearch(t1) << "\n";
		}
	}
	return 0;
}