#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif

#include <stdio.h>
#include <stdlib.h>

int *s[20], n;


int log2(int n)
{
	int l = 0, p = 1;
	while (n > p)
	{
		p <<= 1;
		l++;
	}
	return l;
}


int suma(int a, int b)
{
	if (a > b)
		return 0;

	if (a == b)
		return s[0][a];

	int l = log2(b - a + 1);
	if ((a >> l) << l == a && b - a + 1 == (1 << l))
		return s[l][a >> l];

	l--;
	int c = (b >> l) << l;
	if (a < c)
		return suma(a, c - 1) + suma(c, b);
	else
		return s[0][a] + suma(a + 1, b);
}


int search(int val)
{
    int i, step;
    for (step = 1; step < n; step <<= 1);
    for (i = 0; step; step >>= 1)
        if (i + step < n && suma(0, i + step) <= val)
           i += step;
    return i;
}


int main()
{
	freopen("aib.in", "r", stdin);
	freopen("aib.out", "w", stdout);

	int m, l, i, j, o, a, b, pos, sum;
	scanf("%d%d", &n, &m);

	s[0] = (int *)malloc(n);
	for (i = 0; i < n; i++)
		scanf("%d", &s[0][i]);

	l = log2(n);
	for (i = 1; i <= l; i++)
	{
		s[i] = (int *)malloc((n >> i) + 1);
		for (j = 0; j <= (n >> i); j++)
			s[i][j] = s[i - 1][j << 1] + s[i - 1][(j << 1) + 1];
	}

	pos = n - 1;
	sum = s[l][0];

	for (i = 0; i < m; i++)
	{
		scanf("%d", &o);

		if (o == 0)
		{
			scanf("%d%d", &a, &b);
			a--;
			for (j = 0; j <= l; j++)
				s[j][a >> j] += b;
		}
		else
			if (o == 1)
			{
				scanf("%d%d", &a, &b);
				printf("%d\n", suma(a - 1, b - 1));
			}
			else
			{
				scanf("%d", &a);
				int p = search(a);

				if (suma(0, p) != a)
					printf("-1\n");
				else
					printf("%d\n", p + 1);
			}
	}

	return 0;
}