#include<stdio.h>
#include<math.h>
#include<iostream.h>
#include<fstream.h>
#define N 100001
long n,m,y,z,i,j,step,c[N],b[N],p;
int x,a[N];

long suma(long y,long z)
{long j=y-1,i=z;
unsigned long long s1=0,s2=0;
while(i>0)
       {s1+=c[i];
       i-=(i&(-i));}
while(j>0)
       {s2+=c[j];
       j-=(j&(-j));}
return s1-s2;}
       
long pozitie(long p)
{long step,i,k=p;
for(step=1;step<n;step<<=1);
step>>=1;
if(suma(1,n)==k)
       return n;
for(i=0;step!=0;step>>=1)
if(i+step<n)
       if(c[i+step]<k)
               {i+=step;
               k-=c[i];}
       else
               if(c[i+step]==k)
                      return i+step;
return -1;}

int main()
{fstream f1("aib.in",ios::in);
fstream f2("aib.out",ios::out);
f1>>n>>m;
b[0]=0;
for(i=1;i<=n;i++)
       {f1>>a[i];
       b[i]=b[i-1]+a[i];
       j=i;
       j-=(j&(-j));
       c[i]=b[i]-b[j];}
for(i=1;i<=m;i++)
       {f1>>x;
       if(x==2)
              {f1>>p;
              f2<<pozitie(p)<<endl;}
       else
              if(x==0)
                      {f1>>y>>z;
                      while(y<=n)
                             {c[y]+=z;
                             y+=(y&(-y));}}
              else
                      {f1>>y>>z;
                      f2<<suma(y,z)<<endl;}}
f1.close();
f2.close();
return 0;}