#include<fstream>
#include<cmath>
#define zeros(x) ( (x ^ (x - 1)) & x )
using namespace std;
long n,m,i,v[100001],op,a,b,nr,x,mij,aux,val;
long s[100001];
short zero(long x)
{long nr=0;
	while(x%2==0){ nr++; x/=2;}
	return nr;
}
long put(short x,short p)
{long rez=x,i;
   if(p==0)return 1;
	for(i=2;i<=p;i++)
		rez*=x;
	return rez;
}
 
void modifica(int x, int val)
{
    int i;
    for (i = x; i <= n; i += zeros(i))
        v[i] += val;
}

int calculeaza(int x)
{
    int i, ret = 0;
    for (i = x; i > 0; i -= zeros(i))
        ret += v[i];
    return ret;
}

int search(int val)
{
    int i, step;
    for (step = 1; step < n; step <<= 1);
    for (i = 0; step; step >>= 1)
        if (i + step < n && v[i + step] <= val)
           i += step;
    return i;
}
int main()
{
	ifstream f("aib.in");ofstream g("aib.out");
	f>>n>>m;
	for(i=1;i<=n;i++)
	{ 
	  f>>x; 
	  s[i]=s[i-1]+x; 
	  v[i]=s[i]-s[i-put(2,zero(i))];//v[i] retine suma de la <i-2^k+1,i>,unde k=nr de o finale in reprezent binara a lui 
	}
	for(i=1;i<=m;i++)
	{
		f>>op;
		if(op<2)f>>a>>b;
		else f>>a;
		if(op==0)modifica(a,b);
		if(op==1)g<<calculeaza(b)-calculeaza(a-1)<<"\n";
		if(op==2){ val=-1; search(a); g<<val<<"\n";}
	}
	f.close();g.close();
return 0;}