#include <bits/stdc++.h>
#define pb push_back

using namespace std;

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

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 1e5;

class aib{
    private:
        int n;
        vector <int> dp;

        ll suma(int x){
            ll ans=0;
            for(int i=x;i>0;i-=(i&(-i)))
                ans+=dp[i];
            return ans;
        }

    public:
        aib(int n){
            this->n=n;
            dp.resize(n+1,0);
        }
        void adaug(int pos,int val){
            int i;
            for(i=pos;i<=n;i+=(i&(-i)))
                dp[i]+=val;
        }
        ll query1(int x,int y){
            return suma(y)-suma(x-1);
        }
        int query2(ll x){
            int st,dr,mij;
            st=0;
            dr=n+1;
            while(dr-st > 1){
                mij=(st+dr)/2;
                if(suma(mij) < x)
                    st=mij;
                else
                    dr=mij;
            }
            if(suma(dr) == x)
                return dr;
            return -1;
        }
};

int n,q;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i,j;
    int x,y,z;

    fin>>n>>q;
    aib tree(n);
    for(i=1;i<=n;i++){
        fin>>x;
        tree.adaug(i,x);
    }
    while(q--){
        fin>>x>>y;
        if(!x){
            fin>>z;
            tree.adaug(y,z);
            continue;
        }
        if(x == 1){
            fin>>z;
            fout<<tree.query1(y,z)<<'\n';
            continue;
        }
        fout<<tree.query2(y)<<'\n';
    }

    return 0;
}