#include <fstream>
#include <cstdlib>
#define N_MAX 100000

using namespace std;
int N;
int v[N_MAX];
inline void Update( int x, int y )
{
	for( ; x <= N; x+=( x & -x ) )
		v[x]+=y;
}
inline int Sum( int x )
{
	int s=0;
	for( ; x; x-=( x & -x ) )
		s+=v[x];
	return s;
}
inline int Query( int S, int log2N )
{
	int tIdx, idx;
	for( idx=0; log2N; log2N>>=1 )
	{
		tIdx=idx+log2N;
		if( tIdx <= N )
		{
			if( S == v[tIdx] )
				return tIdx;
			if( v[tIdx] < S )
				S-=v[tIdx], idx=tIdx;
		}
	}
	return -1;
}
inline int log2N( int N )
{
	int x;
	for( x=1; x < N; x*=2 );
	return x;
}
int main( void )
{
	int M, i, x, op, l2N;
	ifstream in( "aib.in" );
	in>>N>>M;
	for( i=1; i <= N; ++i )
	{
		in>>x;
		Update( i, x );
	}
	ofstream out( "aib.out" );
	for( l2N=log2N(N); M; --M )
	{
		in>>op;
		switch( op )
		{
			case 0 : in>>i>>x, Update( i, x ); break;
			case 1 : in>>i>>x, out<<(Sum(x)-Sum(i-1))<<'\n'; break;
			case 2 : in>>x; out<<Query( x, l2N )<<'\n'; break;
		}
	}
	return EXIT_SUCCESS;
}