/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "arbint.in" ;
const char OUT [ ] = "arbint.out" ;
const int MOD = 1000000007 ;
const int MAX = 100099 ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( int a = b ; a >= c ; -- a )

using namespace std ;

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

int A [ MAX << 2 ] ;
int v [ MAX ] ;

inline void update ( int nod , int st , int dr , int pos , int val )
{
    if ( st == dr )
    {
        A [ nod ] = val ;
        return ;
    }

    int mij = ( st + dr ) >> 1 ;

    if ( pos <= mij )
        update ( nod << 1 , st , mij , pos , val ) ;
    else update ( nod << 1 | 1 , mij + 1 , dr , pos , val ) ;

    A [ nod ] = max ( A [ nod << 1 ] , A [ nod << 1 | 1 ] ) ;
}

inline int Q ( int nod , int st , int dr , int a , int b )
{
    if ( a <= st and dr <= b )
    {
        return A [ nod ] ;
    }

    int mij = ( st + dr ) >> 1 ;

    int CET = 0 ;

    if ( a <= mij )
        CET = max ( CET , Q ( nod << 1 , st , mij , a , b ) ) ;

    if ( b > mij )
        CET = max ( CET , Q ( nod << 1 | 1 , mij + 1 , dr , a , b ) ) ;

    return CET ;
}

int main()
{
    int n , m ;
    cin >> n >> m ;
    FORN ( i , 1 , n )
    {
        cin >> v [ i ] ;
        update ( 1 , 1 , n , i , v [ i ] ) ;
    }

    while ( m -- )
    {
        int tip ;
        cin >> tip ;
        if ( !tip ){
            int a , b ;
            cin >> a >> b ;
            cout << Q ( 1 , 1 , n , a , b ) << '\n' ;
        }
        else {
            int a , b ;
            cin >> a >> b ;
            update ( 1 , 1 , n , a , b ) ;
        }
    }
    return 0;
}