#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
vector<int> v(100010);
vector<int> loga(100010);
vector<int> power2(33);
int n,m;
void buildV()
{
    for(int i = 1; i<=n; i++)
    {
        int index2 = i+(i&(-i));
        if(index2<=n)
            v[index2]+=v[i];
    }
}
void buildLog()
{
    for(int i = 2;i<=n;i++)
        loga[i]=loga[i/2]+1;
    for(int i = 0;i<=loga[n];i++)
        power2[i]=pow(2,i);
}
void addV(int x,int pos)
{
    int index2 = pos;
    while(index2<=n)
    {
        v[index2]+=x;
        index2 = index2+(index2&(-index2));
    }

}
int sum(int pos)
{
    int index2 = pos,res=0;
    while(index2>0)
    {
        res+=v[index2];
        index2=index2-(index2&(-index2));
    }
    return res;
}
int sumRange(int s,int f)
{
    return (sum(f)-sum(s-1));
}
void citesteV()
{
    for(int i = 1; i<=n; i++)
        fin>>v[i];
}
int minimK(int st,int dr,int sum,int adder)
{
    if(st<dr)
    {
        int median = v[power2[loga[dr-st+1]]+st-1]+adder;
        if(sum>median)
            return minimK(power2[loga[dr-st+1]]+st-1+1,dr,sum,median);
        else
            return minimK(st,power2[loga[dr-st+1]]+st-1-1,sum,adder);
    }

    if(v[st]+adder<sum)
        st++;
    if(v[st]+adder!=sum&&v[st]!=sum)
        return -1;
    return st;
}

void citesteQ()
{
    int q,x,p;
    while(m--)
    {
        fin>>q>>x;
        if(q==0)
        {
            fin>>p;
            addV(p,x);
        }
        else if(q==1)
        {
            fin>>p;
            fout<<sumRange(x,p)<<'\n';
        }
        else
        {
            fout<<minimK(1,n,x,0)<<'\n';
        }
    }
}
int main()
{
    fin>>n>>m;
    citesteV();
    buildV();
    buildLog();

    //for(int i = 1;i<=n;i++)
    //    cout<<loga[i]<<" ";
    //cout<<endl;
    //for(int i = 0;i<=power2.size();i++)
    //    cout<<power2[i]<<" ";
    //cout<<endl;
    citesteQ();

    return 0;
}