#include <fstream>
//#include <iostream>
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
struct aint {
    int a, b;
    int l, r;
    int v;
};
aint pre[200001];
int mems = 0;
void build(int node) {
    int l = pre[node].l;
    int r = pre[node].r;
    if(l != r) {
        pre[node].a = (mems++);
        pre[pre[node].a].l = l;
        pre[pre[node].a].r = l + (r - l + 1)/2 - 1;
        pre[pre[node].a].a = NULL;
        pre[pre[node].a].b = NULL;
        pre[pre[node].a].v = 0;
        pre[node].b = (mems++);
        pre[pre[node].b].l = l + (r - l + 1)/2;
        pre[pre[node].b].r = r;
        pre[pre[node].b].a = NULL;
        pre[pre[node].b].b = NULL;
        pre[pre[node].b].v = 0;
        build(pre[node].a);
        build(pre[node].b);
    }
}
int query(int node, int l, int r) {
    if((l == pre[node].l) && (r == pre[node].r))
        return pre[node].v;
    else if(r <= pre[pre[node].a].r)
        return query(pre[node].a, l, r);
    else if(l >= pre[pre[node].b].l)
        return query(pre[node].b, l, r);
    else return query(pre[node].a, l, pre[pre[node].a].r) + query(pre[node].b, pre[pre[node].b].l, r);
}
void add(int node, int add, int target){
    while(true){
        pre[node].v += add;
        if(pre[node].a == NULL)
            return;
        if(pre[pre[node].a].r >= target)
            node = pre[node].a;
        else node = pre[node].b;
    }
}
int root;
int main() {
    int n, m;
    cin>>n>>m;
    root = (mems++);
    pre[root].l = 1;
    pre[root].r = n;
    pre[root].v = 0;
    pre[root].a = NULL;
    pre[root].b = NULL;
    build(root);
    for(int x = 1, tmp; x<=n; x++){
        cin>>tmp;
        add(root, tmp, x);
    }
    for(int x = 0, req;x<m;x++){
        cin>>req;
        if(req == 0){
            int target, add_;
            cin>>target>>add_;
            add(root, add_, target);
        }else if(req == 1){
            int l, r;
            cin>>l>>r;
            cout<<query(root, l, r)<<'\n';
        }else{
            int v;
            cin>>v;
            int l = 1, r = n, m;
            while(l != r){
                m = l + (r - l)/2 + 1;
                int v1 = query(root, 1, m);
                if(v1 == v){
                    l = m;
                    r = m;
                    break;
                }else if(v1 < v){
                    l = m + 1;
                }else r = m - 1;
            }
            m = l;
            if(query(root, 1, m) != v)
                cout<<-1<<'\n';
            else cout<<l<<'\n';
        }
    }
    return 0;
}