/*
ID: gabriel100
LANG: C++
TASK:
*/

//#include <iostream>
#include <cstdio>
#include <algorithm>
//#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
#include <bitset>
#include <set>

#define nl '\n'
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long
#define ll long long
#define LocalName "data"
#define ProblemName "aib"
#ifdef INFOARENA
#define Filename ProblemName
#else
#define Filename LocalName
#endif
#define Input Filename".in"
#define Output Filename".out"
#define str(sir) #sir
#define N 100'000
#define MOD 32173
using namespace std;

ifstream cin(Input);
ofstream cout(Output);
template<class a, class type>
void print(a v, type t) {
    for_each(all(v), [](type x) { cout << x.first << ' '; });
    cout << nl;
}
int n,m,v[N],cod,a,b;
inline int GetParent(int n){
    return n-(n&-n);
}
inline int GetNext(int n){
    return n+(n&-n);
}
inline void Update(int index,int val){
    while (index <= n+1){
        v[index] += val;
        index = GetNext(index);
    }
}
inline ll GetSum(int index){
    ll sum = 0;
    while(index){
        sum += v[index];
        index = GetParent(index);
    }
    return sum;
}
inline int SearchSum(int suma){
        //
}
int BinarySearch(int arr[],int size,int elem){
    int s = 1;
    while(s<size) s<<=1;
    int i;
    for(i=0;s;s>>=1){
        if(i+s<size && elem >= GetSum(i+s)) i+=s;
    }
    return GetSum(i)==elem?i:-1;
}
int main() {
    ios_base::sync_with_stdio(false);
    //    clock_t tStart = clock();
    cin >> n >> m;
    for(int i=0;i<n;++i) {
        cin >> a;
        Update(i+1,a);
    }
    for(int i=0;i<m;++i){
        cin >> cod;
        if(!cod){
            cin >> a >> b;
            Update(a,b);
        } else if(cod == 1){
            cin >> a >> b;
            cout << GetSum(b) - GetSum(a-1) << nl;
        } else {
            cin >> a;
            cout << BinarySearch(v,n+1,a) << nl;
        }
    }
    //    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}