#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll


ifstream fin ("aib.in"); ofstream fout ("aib.out");
#define cin fin
#define cout fout


int n, m, a[100010];





int fw[100010];

void update(int i, int x){
a[i]+=x;
for(int j=i; j<=n; j+=(j&(-j))){
    fw[j]+=x;
}

}


int query(int i){
int res=0;
for(int j=i; j>0; j-=(j&(-j))){
    res+=fw[j];
}
return res;
}





int bs(int sum){
//first index, pref[i]>=sum;


int l=1, r=n+1, m=(l+r)>>1ll;

while(l<r){
    m=(l+r)>>1ll;
    if( query(m)>=sum ){
        r=m;
    }
    else{
        l=m+1;
    }
    m=(l+r)>>1ll;
}

if(m==(n+1)){
    return -1;
}

if(query(m)==sum ){
    return m;
}
else{
    return -1;
}

}










int32_t main(){
INIT

cin>>n>>m;
for(int i=1; i<=n; i++){
    cin>>a[i];
    update(i, a[i]);
}

for(int i=1; i<=m; i++){
    int tp;
    cin>>tp;
    if(tp==0){
        int a, b;
        cin>>a>>b;
        update(a, b);
    }
    if(tp==1){
        int a, b;
        cin>>a>>b;
        cout<<( query(b)-query(a-1) )<<"\n";
    }
    if(tp==2){
        int a;
        cin>>a;
        cout<<bs(a)<<"\n";
    }
}

return 0;
}