#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

const string fis = "arbint";
ifstream is(fis + ".in");
ofstream os(fis + ".out");

using VI = vector<int>;
using VS = vector<short>;
using VVI = vector<VI>;

int n, N, m;
int tip, a, b;
VI arb;

int sum(int nod, int st, int dr)
{
    if ( a <= st && dr <= b )
        return arb[nod];
    int md = ( st + dr ) / 2, s = 0;
    if ( a <= md )
        s = sum(2 * nod, st, md);
    if ( md < b )
        s = max(s, sum(2 * nod + 1, md + 1, dr));
    return s;
}

void update(int nod, int st, int dr)
{
    if ( st == dr )
    {
        arb[nod] = b;
        return;
    }
    int md = ( st + dr ) / 2;
    if ( a <= md )
        update(2 * nod, st, md);
    else
        update(2 * nod + 1, md + 1, dr);
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

int main()
{
    is >> n >> m;
    /*for ( N = 1; N < n; N <<= 1 );
    arb = VI(2 * N);
    for ( int i = 0; i < n; ++i )
        is >> arb[N + i];
    for ( int i = N - 1; i; --i )
        arb[i] = max(arb[2 * i], arb[2 * i + 1]);*/
    arb = VI(4 * n + 1);
    for ( a = 1; a <= n; ++a )
    {
        is >> b;
        update(1, 1, n);
    }
    while ( m-- )
    {
        is >> tip >> a >> b;
        if ( tip )
        {
            update(1, 1, n);
            //arb[N + a - 1] = b;
            //for ( int i = ( N + a - 1 ) / 2; i; i /= 2 )
               // arb[i] = max(arb[2 * i], arb[2 * i + 1]);
        }
        else
            os << sum(1, 1, n) << "\n";
    }
    is.close();
    os.close();
    return 0;
}