#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 1e5 + 5;

int aint[NMax * 2];

void Update(int node, int lo, int hi, int pos, int val){
    if(lo == hi){
        aint[node] += val;
        return;
    }
    int mid = (lo + hi) >> 1;
    if(pos <= mid){
        Update(node * 2, lo, mid, pos, val);
    } else {
        Update(node * 2 + 1, mid + 1, hi, pos, val);
    }
    aint[node] = aint[node * 2] + aint[node * 2 + 1];
}

int Query(int node, int lo, int hi, int a, int b){
    if(a <= lo && b >= hi){
        return aint[node];
    }
    int mid = (lo + hi) >> 1;
    int A = 0;
    int B = 0;
    if(a <= mid){
        A = Query(node * 2, lo, mid, a, b);
    }
    if(b > mid){
        B = Query(node * 2 + 1, mid + 1, hi, a, b);
    }
    return (A + B);
}

void Bsearch(int n, int k){
    int lo = 1;
    int hi = n;
    int mid, val;
    while(lo <= hi){
        mid = (lo + hi) >> 1;
        val = Query(1, 1, n, 1, mid);
        if(val == k){
            fout << mid << "\n";
            return;
        }
        if(val > k){
            hi = mid - 1;
        } else {
            lo = mid + 1;
        }
    }
    fout << -1 << "\n";
}

int main(){
    int n, m, x, t, a, b;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> x;
        Update(1, 1, n, i, x);
    }
    for(int i = 1; i <= m; i++){
        fin >> t;
        if(t == 0){
            fin >> a >> b;
            Update(1, 1, n, a, b);
        }
        if(t == 1){
            fin >> a >> b;
            fout << Query(1, 1, n, a, b) << "\n";
        }
        if(t == 2){
            fin >> a;
            Bsearch(n, a);
        }
    }
    return 0;
}