#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 + 5;
int n, queries, v[nmax], op, a, b, val;
int lsb(int x)
{
    return (x & (-x));
}
void update(int x, int y)
{
    for(int i = x; i <= n; i += lsb(i))
    {
        v[i] += y;
    }
}
int query(int x)
{
    int sum = 0;
    for(int i = x; i; i -= lsb(i))
    {
        sum += v[i];
    }
    return sum;
}
int cb(int suma)  // cautarea binara a lui Patrascu pe aib
{
    int step = 1, result = 0;
    for(; step <= n; step <<= 1)
    {
        for(; step > 0; step >>= 1)
        {
            if(step + result <= n)
            {
                if(query(step + result) <= suma)
                {
                    suma -= query(step + result);
                    result += step;
                }
            }
        }
    }
    if(1 <= result && result <= n)
    {
    return result;
    }
    else
    {
        return -1;
    }
}
ifstream fin("aib.in");
ofstream fout("aib.out");
int32_t main()
{
    fin >> n >> queries;
    int u;
    for(int i = 1; i <= n; ++i)
    {
        fin >> v[i];
        update(i, v[i]);
    }
    for(int i = 1; i <= queries; ++i)
    {
        fin >> op;
        if(op == 0)
        {
            fin >> a >>  b;
            update(a, b);
        }
        if(op == 1)
        {
            fin >> a >> b;
            fout << query(b) - query(a - 1) << '\n';
        }
        if(op == 2)
        {
            fin >> a;
            fout << cb(a) << '\n';
        }
    }
    return 0;
}