#include <fstream>
#include <vector>

using namespace std;

void actualizare(int poz, int val, vector <int> &aib)
{
    int n = (int)aib.size() - 1;
    while (poz <= n)
    {
        aib[poz] += val;
        int p2 = poz & (-poz);
        poz += p2;
    }
}

int interogare(int poz, vector <int> &aib)
{
    int sum = 0;
    while (poz != 0)
    {
        sum += aib[poz];
        int p2 = poz & (-poz);
        poz -= p2;
    }
    return sum;
}

int pozitie_max(int s, vector <int> &aib)
{
    int n = (int)aib.size() - 1, p2 = 1;
    while (2 * p2 <= n)
    {
        p2 *= 2;
    }
    int poz = 0;
    while (p2 != 0)
    {
        if (poz + p2 <= n && aib[poz+p2] <= s)
        {
            poz += p2;
            s -= aib[poz];
        }
        p2 /= 2;
    }
    return poz;
}

int main()
{
    ifstream in("aib.in");
    ofstream out("aib.out");
    int n, q;
    in >> n >> q;
    vector <int> aib(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        int v_i;
        in >> v_i;
        actualizare(i, v_i, aib);
    }
    for (int i = 0; i < q; i++)
    {
        int tip;
        in >> tip;
        if (tip == 0)
        {
            int poz, val;
            in >> poz >> val;
            actualizare(poz, val, aib);
        }
        else if (tip == 1)
        {
            int st, dr;
            in >> st >> dr;
            out << interogare(dr, aib) - interogare(st - 1, aib) << "\n";
        }
        else
        {
            int suma;
            in >> suma;
            int poz = pozitie_max(suma, aib);
            if (poz == 0 || interogare(poz, aib) < suma)
            {
                poz = -1;
            }
            out << poz << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}