#include <fstream>
#include <vector>

using namespace std;

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

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

int caut_direct(vector <int> &aib, int val) {
    int n = (int)aib.size() - 1, p2 = 1, rez = 0, val_ini = val;
    while (p2 <= n / 2) {
        p2 *= 2;
    }
    while (p2 > 0) {
        if (rez + p2 <= n && aib[rez+p2] < val) {
            val -= aib[rez+p2];
            rez += p2;
        }
        p2 /= 2;
    }
    if (rez == n || interogare(aib, rez + 1) > val_ini) {
        rez = -1;
    } else {
        rez++;
    }
    return rez;
}

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 x_i;
        in >> x_i;
        actualizare(aib, i, x_i);
    }
    for (int i = 0; i < q; i++) {
        int tip;
        in >> tip;
        if (tip == 0) {
            int poz, val;
            in >> poz >> val;
            actualizare(aib, poz, val);
        } else if (tip == 1) {
            int st, dr;
            in >> st >> dr;
            out << interogare(aib, dr) - interogare(aib, st - 1) << "\n";
        } else {
            int val;
            in >> val;
            out << caut_direct(aib, val) << "\n";
        }
    }
    return 0;
}