#include <cstdio>
#include <algorithm>

#define NMAX 400005

using namespace std;

int N, M, arb[260005], maxim, a, b;

void actualizare(int nod, int st, int dr)
{
    if (st == dr)
    {
        arb[nod] = b;
        return;
    }

    int mij = (st + dr) / 2;
    if (a <= mij)
        actualizare(2 * nod, st, mij);
    else
        actualizare(2 * nod + 1, mij + 1, dr);
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

void interogare(int nod, int st, int dr)
{
    if (a <= st && dr <= b)
    {
        maxim = max(maxim, arb[nod]);
        return;
    }

    int mij = (st + dr) / 2;
    if (a <= mij)
        interogare(2 * nod, st, mij);
    if (b > mij)
        interogare(2 * nod + 1, mij + 1, dr);
}

void citire()
{
    int nr;

    scanf("%d %d", &N, &M);
    for (a = 1; a <= N; ++a)
    {
        scanf("%d", &b);
        actualizare(1, 1, N);
    }
}

void rezolvare()
{
    int t;

    for (int i = 1; i <= M; ++i)
    {
        scanf("%d %d %d", &t, &a, &b);
        if (t == 0)
        {
            maxim = 0;
            interogare(1, 1, N);
            printf("%d\n", maxim);
        }
        else
            actualizare(1, 1, N);
    }
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    citire();
    rezolvare();

    return 0;
}