#include<fstream.h>
#define N 100001
long n,m,y,z,i,j,s,c[N],a[N];
int x;
long suma(long y,long z)
{long s1=0,s2=0;
while(z>0)
      s1+=c[z],z-=(z&(-z));
y--;
while(y>0)
      s2+=c[y],y-=(y&(-y));
return s1-s2;}

long pozitie(long s,long p)
{for(i=0;s!=0;s>>=1)
if(i+s<=n)
      if(c[i+s]<p)
            i+=s,p-=c[i];
      else
            if(c[i+s]==p)
                  return i+s;
return -1;}

int main()
{ifstream f("aib.in");
ofstream g("aib.out");
f>>n>>m;
for(s=1;s<=n;s<<=1);
s>>=1;
a[0]=0;
for(i=1;i<=n;i++)
     {f>>a[i];
     a[i]+=a[i-1];
     j=i-(i&(-i));
     c[i]=a[i]-a[j];}
while(m--)
     {f>>x>>y;
     if(x==2)
             g<<pozitie(s,y)<<"\n";
     else
             {f>>z;
             if(!x)
                     {while(y<=n)
                             c[y]+=z,y+=(y&(-y));}
             else
                     g<<suma(y,z)<<"\n";}}
f.close();
g.close();
return 0;}