#include <cstdio>
#include <vector>
using namespace std;

int n, nOp, poz;
vector <int> c;

void Actualizare(int x, int y){
	int ind = x, poz = 0;
	while (ind <= n){
		c[ind] += y;
		while ((ind & (1<<poz)) == 0) poz++;
		ind += (1<<poz);
		poz++;
	}
}

int Suma(int x){
	int s = 0, ind = x, poz = 0;
	while (ind > 0){
		s += c[ind];
		while ((ind & (1 << poz)) == 0) poz++;
		ind -= (1<<poz);
		poz++;
	}
	return s;
}

int Suma(int x, int y){return Suma(y) - Suma(x-1);}
int Cauta(int st, int dr, int x){
	int m = (st + dr) / 2;
	if (st > dr) return -1;
	if (Suma(m) == x) return m;
	if (Suma(m) > x) return Cauta(st, m-1, x);
	return Cauta(m+1, dr, x);
}

int main()
{
	freopen ("aib.in", "r", stdin), freopen("aib.out", "w", stdout);
	scanf("%d %d", &n, &nOp);
	int i, x, y, op;
	c.assign(n+1, 0);
	for (i = 1; i <= n; i++){
		scanf("%d", &x);
		Actualizare (i, x);
	}
	
	for (i = 0; i < nOp; i++){
		scanf("%d %d", &op, &x);
		switch (op){
		case 0 : 
			scanf("%d", &y);
			Actualizare(x, y);
			break;
		case 1:
			scanf("%d", &y);
			printf ("%d\n", Suma(x, y));
			break;
		case 2:
			int ind = 1;
			while (x > c[ind] && ind < n) ind <<= 1;
			printf ("%d\n",Cauta(ind / 2 > 0 ? ind / 2 : 1, ind > n ? n : ind, x));
		}
	}
}