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

long q(long s,long p)
{for(i=0;s;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()
{freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(s=1;s<=n;s<<=1);
s>>=1,a[0]=0;
for(i=1;i<=n;i++)
     scanf("%ld",&a[i]),a[i]+=a[i-1],j=i-(i&(-i)),c[i]=a[i]-a[j];
while(m--)
     {scanf("%d%ld",&x,&y);
     if(x==2)
             printf("%ld\n",q(s,y));
     else
             {scanf("%ld",&z);
             if(!x)
                     while(y<=n)
                             c[y]+=z,y+=(y&(-y));
             else
                     printf("%ld\n",r(y,z));}}
return 0;}