#include<bits/stdc++.h>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')

typedef long long int lld;
const int INF = (1LL << 30) - 1;
const lld LINF = (1LL << 62) - 1;
const int NMAX = (int)1e5;

int N, M;
int A[NMAX + 5];
int AIB[NMAX + 5];

void update(int poz, int val) {
    for (int i = poz; i <= N; i += i & (-i))
        AIB[i] += val;
}

int query(int poz) {
    int ans = 0;
    for (int i = poz; i >= 1; i -= i & (-i))
        ans += AIB[i];
    return ans;
}

int search(int a) {
    int step = 0;

    for (step = 1; step < N; step *= 2);

    for (int i = 0; step >= 1; step /= 2)
        if (i + step <= N && a >= AIB[i + step]) {
            i += step;
            a -= AIB[i];
            if (a == 0)
                return i;
        }

    return -1;
}

int main() {
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);

    scanf("%d%d", &N, &M);

    for (int i = 1; i <= N; i++) {
        scanf("%d", &A[i]);
        update(i, A[i]);
    }

    for (int i = 1, op, a, b; i <= M; i++) {
        scanf("%d", &op);

        if (op == 0) {
            scanf("%d%d", &a, &b);
            update(a, b);
            continue;
        }

        if (op == 1) {
            scanf("%d%d", &a, &b);
            printf("%d\n", query(b) - query(a - 1));
            continue;
        }

        if (op == 2) {
            scanf("%d", &a);
            printf("%d\n", search(a));
            continue;
        }
    }

    return 0;
}