#include <cstdio>

using namespace std;

int n;
int aib[100002];

int zeros(int x)
{
    return (x ^ (x-1)) & x;
}

void update(int pos, int val)
{
    for (int i = pos; i <= n; i += zeros(i))
        aib[i] += val;
}

int sum(int limit)
{
    int result = 0;
    for (int i = limit; i > 0; i -= zeros(i))
        result += aib[i];
    return result;
}

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

    int m;
    scanf("%d%d", &n, &m);

    for (int x, i = 1; i <= n; ++i)
    {
        scanf("%d", &x);
        update(i, x);
    }

    int t, a, b;
    while (m--)
    {
        scanf("%d", &t);
        if (t < 2)
        {
            scanf("%d%d", &a, &b);
            if (t == 0)
                update(a, b);
            else
                printf("%d\n", sum(b)-sum(a-1));
        }
        else
        {
            scanf("%d", &a);
            bool ok = false;
            int steps;
            for (steps = 1; steps < n; steps <<= 1);

            for (int i = 0; steps; steps >>= 1)
                if (i + steps <= n)
                    if (aib[i+steps] <= a)
                    {
                        a -= aib[i+steps];
                        i += steps;
                        if (a == 0)
                        {
                            ok = true;
                            printf("%d\n", i);
                            break;
                        }
                    }
                if (!ok)
                    printf("-1\n");
        }
    }

    return 0;
}