#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second

ifstream fin( "arbint.in" );
ofstream fout( "arbint.out" );

int n,m,i,x,a,b,ans,arb[400010];

void update( int nod, int left, int right, int poz, int val )
{
    int middle = ( left + right ) / 2;
    if( left == right )
    {
        arb[ nod ] = val;
        return;
    }
    if( poz <= middle )
        update( 2 * nod , left , middle , poz , val );
    else
        update( 2 * nod + 1 , middle + 1 , right , poz , val );

    arb[ nod ] = max( arb[ 2 * nod ] , arb[ 2 * nod + 1 ] );
}

void query( int nod, int left, int right, int L, int R )
{
    int middle = ( left + right ) / 2;
    if( left > R || right < L )
        return;
    if( L <= left && right <= R )
    {
        ans = max( ans , arb[ nod ] );
        return;
    }
    query( 2 * nod , left , middle , L , R );
    query( 2 * nod + 1 , middle + 1 , right , L , R );
}

int main()
{

    fin>>n>>m;
    for( i = 1 ; i <= n ; i++ )
    {
        fin>>x;
        update( 1 , 1 , n , i , x );
    }

    for( i = 1 ; i <= m ; i++ )
    {
        fin>>x>>a>>b;
        if( x == 0 )
        {
            ans = 0;
            query( 1 , 1 , n , a , b );
            fout<<ans<<'\n';
        }
        else
        {
            update( 1 , 1 , n , a , b );
        }
    }

return 0;
}