#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[4 * mxN], N, M;

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

void Update(int node, int Pos, int left, int right, int value) {
    if (left == right) {
        MaxArb[node] += value;
        return;
    }
    int mij = (left + right) / 2;
    if (mij >= Pos) {
        Update(2 * node, Pos, left, mij, value);
    } else {
        Update(2 * node + 1, Pos, mij + 1, right, value);
    }
    MaxArb[node] = MaxArb[2 * node] + MaxArb[2 * node + 1];
}

void Query(int node, int left_req, int right_req, int left, int right, int &sum) {
    if (left_req <= left && right <= right_req) {
        sum += MaxArb[node];
        return;
    }
    int mij = (left + right) / 2;
    if (mij >= left_req) {
        Query(2 * node, left_req, right_req, left, mij, sum);
    }
    if (mij < right_req) {
        Query(2 * node + 1, left_req, right_req, mij + 1, right, sum);
    }
}

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

void solve() {
    fin >> N >> M;
    for (int i = 1; i <= N; ++i) {
        int x; fin >> x;
        Update(1, i, 1, N, x);
    }
    while (M--) {
        int op;
        fin >> op;
        if (op == 0) {
            int a, b;
            fin >> a >> b;
            Update(1, a, 1, N, b);
        } else if (op == 1) {
            int a, b;
            fin >> a >> b;
            int sum = 0;
            Query(1, a, b, 1, N, sum);
            fout << sum << nl;
        } else {
            int k; fin >> k;
            fout << Search(1, N, k) << 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, ...)