#include <bits/stdc++.h>
#define ll long long
#define nl '\n'
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define F0R(i, a, b) for (int i = a; i >= b; --i)
#define FORd(i, n) for (int i = 0; i < n; ++i)
#define F0Rd(i, n) for (int i = n - 1; i >= 0; --i)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN = 1e5 + 5;

int MaxArb[mxN], N, M;

ifstream fin("aib.in");
ofstream fout("aib.out");

void Update(int pos, int value) {
    for (int i = pos; i <= N; i += (i & (-i))) {
        MaxArb[i] += value;
    }
}

int Query(int pos) {
    int sum = 0;
    for (int i = pos; i > 0; i -= (i & (-i))) {
        sum += MaxArb[i];
    }
    return sum;
}

int Search(int left, int right, int sum) {
    if (left == right) {
        if (Query(left) == sum) {
            return left;
        }
        return -1;
    }
    int mij = (left + right) / 2;
    if (Query(mij) == sum) {
        return mij;
    }
    if (Query(mij) > sum) {
        return Search(left, mij, sum);
    }
    if (Query(mij) < sum) {
        return Search(mij + 1, right, sum);
    }
}

void solve() {
    fin >> N >> M;
    for (int i = 1; i <= N; ++i) {
        int x; fin >> x;
        Update(i, x);
    }
    while (M--) {
        int op;
        fin >> op;
        if (op == 0) {
            int a, b;
            fin >> a >> b;
            Update(a, b);
            continue;
        }
        if (op == 1) {
            int a, b;
            fin >> a >> b;
            fout << Query(b) - Query(a - 1) << nl;
            continue;
        }
        int sum; fin >> sum;
        fout << Search(1, N, sum) << nl;
    }
}

int main() {
    fin.tie(0); fout.tie(0);
    ios::sync_with_stdio(0);
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

//read the question correctly (ll vs int)
//what's the meaning of the problem ? Think outside the BOX !!!
//edge cases ?
//make it simple
//write everything (observations, edge cases, ideas, steps, methods, ...)