#include<fstream.h>
#define N 100001
long n,m,y,z,i,j,step,c[N],a[N],s1,s2;
int x;
long pozitie(long step,long p)
{for(i=0;step!=0;step>>=1)
if(i+step<=n)
      if(c[i+step]<p)
            i+=step,p-=c[i];
      else
            if(c[i+step]==p)
                  return i+step;
return -1;}

int main()
{ifstream f("aib.in");
ofstream g("aib.out");
f>>n>>m;
for(step=1;step<=n;step<<=1);
step>>=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(step,y)<<"\n";
     else
             {f>>z;
             if(!x)
                     {while(y<=n)
                             c[y]+=z,y+=(y&(-y));}
             else
                     {s1=s2=0;
                     while(z>0)
                             s1+=c[z],z-=(z&(-z));
                     y--;
                     while(y>0)
                             s2+=c[y],y-=(y&(-y));
                     g<<s1-s2<<"\n";}}}
f.close();
g.close();
return 0;}