#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("aib.in");
ofstream fout ("aib.out");
int i,n,q,x,aib[100001],j,a,b,t,y,st,dr,mid;
void update (int x,int p)
{
    for (int i=p; i<=n; i+=(i&(-i))) aib[i]+=x;
}
int sum (int p)
{
    int i,s=0;
    for (i=p; i>0; i-=(i&(-i)))
        s+=aib[i];
    return s;
}
int main()
{
    fin>>n>>q;
    for (i=1; i<=n; i++)
    {
        fin>>x;
        update(x,i);
    }
    for (i=1; i<=q; i++)
    {
        fin>>x;
        if (x==0)
        {
            fin>>a>>b;
            update(b,a);
        }
        else if (x==1)
        {
            fin>>a>>b;
            fout<<sum(b)-sum(a-1)<<'\n';
        }
        else if (x==2)
        {
            fin>>y;
            st=1;
            dr=n;
            while (st<=dr)
            {
                mid=(st+dr)/2;
                t=sum(mid);
                if (t==y) break;
                if (t<y) st=mid+1;
                if (t>y) dr=mid-1;
            }
            if (sum(mid)==y) fout<<mid<<'\n';
            else fout<<-1<<'\n';
        }
    }

    return 0;
}