#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int m,n,v[100005],op,a,b;
int p2[]={1 , 2 , 4 , 8 , 16 , 32 , 64 , 128 , 256 , 512 , 1024 , 2048 , 4096 , 8192 , 16384 , 32768 , 65536 , 131072 , 262144 , 524288 , 1048576 , 2097152 , 4194304 , 8388608 , 16777216 , 33554432 , 67108864 , 134217728 , 268435456 , 536870912 , 1073741824};

void update(int ind , int val)
{
    int bn=0;
    while(ind<=n)
    {
        v[ind]=v[ind]+val;
        while((ind&p2[bn])==0) bn++;
        ind=ind+p2[bn];
        bn++;
    }
}

int suma( int st, int dr)
{
    int s2=0,s1=0,bn=0;
    while(dr>0)
    {
        s1=s1+v[dr];
        while((dr&p2[bn])==0) bn++;
        dr=dr-p2[bn];
        bn++;
    }
    st--;
    bn=0;
    while(st>0)
    {
        s2=s2+v[st];
        while((st&p2[bn])==0) bn++;
        st=st-p2[bn];
        bn++;
    }
    return s1-s2;
}

int poz(int sum)
{
    int pos=n+1, B, X;
	int limst=0, limdr=n+1, c=0, s=0;
	B=n;
	while(B>0)
	{
		s=s+v[B];
		while ( !(B & (1<<c)) ) c++;
		B -= (1<<c);
		c++;
	}
	B=n;
	if(s==sum) pos=n;
	while(B)
	{
		B=(limst+limdr)>>1;
		s=0;
		c=0;
		X=B;
		while(X>0)
		{
			s=s+v[X];
			while ( !(X & (1<<c)) ) c++;
			X -= (1<<c);
			c++;
		}
		if(s>sum)
		{
			if ( limdr > B ) limdr = B;
			B--;
		}
		else if (s==sum) 
			{
				if(B<pos) pos=B; 
				limdr=B;
				B--;
			}
			else 
			{
				if(limst<B) limst=B;
				B++;
			}
			if ( B <= limst ) break;
			if ( B >= limdr ) break;
	}
	if (pos==n+1) return -1;
	return pos;
}

int main()
{
    int i;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>a;
        update(i,a);
    }
    for(i=1;i<=m;i++)
    {
        f>>op;
        switch(op)
        {
            case 0: f>>a>>b; update(a,b); break;
            case 1: f>>a>>b; g<<suma(a,b)<<'\n'; break;
            case 2: f>>a; g<<poz(a)<<'\n'; break;
        }
    }
    f.close();
    g.close();
    return 0;
}