#include <fstream>
using namespace std;

ifstream is("arbint.in");
ofstream os("arbint.out");

const int MAXN = 100001;

int arb[4*MAXN];
int n, m, a, b;
int maxim;
int value, pos;

void Update(int nod, int l, int r);
void Query(int nod, int l, int r);

int main()
{
    is >> n >> m;
    for( int i = 1; i <= n; ++i )
    {
        is >> a;
        pos = i;
        value = a;
        Update(1, 1, n);
    }
    int op;
    for( int i = 1; i <= m; ++i )
    {
        is >> op >> a >> b;
        if( op == 0 )
        {
            maxim = -1;
            Query(1, 1, n);
            os << maxim << '\n';
        }
        else
        {
            pos = a;
            value = b;
            Update(1, 1, n);
        }
    }
    is.close();
    os.close();
    return 0;
}


void Update(int nod, int l, int r)
{
    if( l == r )
    {
        arb[nod] = value;
        return;
    }

    int mid = ( l + r ) / 2;
    if( pos <= mid )
        Update(2 * nod, l, mid);
    else
        Update(2 * nod + 1, mid + 1, r);

    if( arb[2 * nod] > arb[2 * nod + 1] )
        arb[nod] = arb[2 * nod];
    else
        arb[nod] = arb[2 * nod + 1];
}

void Query(int nod, int l, int r)
{
    if( a <= l && b >= r )
    {
        if( maxim < arb[nod] )
            maxim = arb[nod];
        return;
    }

    int mid = (l + r) / 2;
    if( a <= mid )
        Query( 2 * nod, l, mid );
    if( mid < b )
        Query( 2 * nod + 1, mid + 1, r );
}