#define DEBUG 0

#include <stdio.h>
#include <vector>

#if DEBUG==1
#include <iostream>
#endif
using namespace std;

// int must have the = and < operators
vector<int> Elem;
int Size;

int* _init_arr;
void _Init(unsigned tree_index, int l, int r)
{
    if (Elem.size() <= tree_index) Elem.resize(tree_index+1);

    if (l != r)
    {
        _Init(tree_index*2, l, (l+r)/2 );
        _Init(tree_index*2 + 1, (l+r)/2 + 1, r);
    }
}

void _Init_Arr(unsigned tree_index, int l, int r)
{
    if (Elem.size() <= tree_index) Elem.resize(tree_index+1);

    if (l != r)
    {
        _Init_Arr(tree_index*2, l, (l+r)/2 );
        _Init_Arr(tree_index*2 + 1, (l+r)/2 + 1, r);

        Elem[tree_index] = (Elem[2*tree_index] < Elem[2*tree_index + 1]) ?
            Elem[2*tree_index + 1] : Elem[2*tree_index] ;
    }

    else {
        Elem[tree_index] = _init_arr[l];
    }
}

int _modify_index; int _modify_newVal;
void _Modify (unsigned index, int l, int r)
{
    if (l != r)
    {
        int m = l+(r-l)/2;

        if (_modify_index > m) _Modify (2*index + 1, m+1, r);
        else _Modify (2*index, l, m);

        Elem[index] = (Elem[2*index] < Elem[2*index + 1]) ? Elem[2*index + 1] : Elem[2*index] ;
    }

    else {
        Elem[index] = _modify_newVal;
    }
}

int sl, sr;
int _Max (unsigned index, int l, int r)
{
    if ((sl == l && sr == r) || l==r) return Elem[index];

    int ml = max(sl, l);
    int mr = min(sr, r);

    int mid = l + (r-l)/2;

    // Go only left
    if (mr <= mid) return _Max(2*index, l, mid);
    // Only right
    else if (ml > mid) return _Max(2*index + 1, mid+1, r);
    // Both
    else {
        int a = _Max(2*index, l, mid);
        int b = _Max(2*index + 1, mid+1, r);
        return (a<b) ? b : a;
    };
}


void Initialize(int size)
{
    Size = size;
    _Init(1,1,size);
}

void Initialize(int arr[], int size)
{
    Size = size;
    _init_arr = arr;
    _Init_Arr(1,1,size);
}

void ModifyValue (int index, int newVal)
{
    _modify_index = index; _modify_newVal = newVal;
    _Modify(1,1,Size);
}

int GetMax (int left, int right)
{
    sl = left; sr = right;
    return _Max(1,1,Size);
}

#if DEBUG==1
void __Display()
{
    cout<<"Items: ";
    for (int i=1; i<Elem.size(); i++)
        cout<<Elem[i]<<" ";
}
#endif




int main()
{
    freopen ("arbint.in", "r", stdin);
#if DEBUG==0
    freopen ("arbint.out", "w", stdout);
#endif

    int N, M, x, y, op;
    scanf("%d %d", &N, &M);

    
    _init_arr = new int[N+1];

    for (int i=1; i<=N; i++)
        scanf("%d", &_init_arr[i]);

    Initialize(_init_arr, N);

#if DEBUG==1
    arb.__Display(); printf("\n");
#endif

    for (; M>0; M--)
    {
        scanf("%d %d %d", &op, &x, &y);
        if (op == 0) printf("%d\n", GetMax(x,y));
        else ModifyValue(x,y);
    }

    delete[] _init_arr;
    return 0;
}