#include <cstdio>
using namespace std;

int maxim, v[600005];
int poz, x, a, b, val;

int MyMax(int aa, int bb)
{
    if (aa > bb)
        return aa;
    return bb;
}

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

    int div = (st + dr) / 2;
    if (poz <= div)
        update (2 * nod, st, div);
    else
        update (2 * nod + 1, div + 1, dr);
    v[nod] = MyMax(v[2 * nod], v[2 * nod + 1]);
}

void query(int nod, int st, int dr)
{
    if (a <= st && dr <= b)
    {
        if (v[nod] > maxim)
            maxim = v[nod];
        return;
    }
    int div = (st + dr) / 2;
    if (a <= div)
        query(2 * nod, st, div);
    if (div < b)
        query(2 * nod + 1, div + 1, dr);
}
int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int n, m, tip;

    scanf("%d %d", &n, &m);
    for (register int i = 1; i <= n; ++i)
    {
        scanf("%d", &x);
        poz = i; val = x;
        update(1, 1, n);
    }

    for (register int i = 1; i <= n; ++i)
    {
        scanf ("%d %d %d", &tip, &a, &b);
        if (tip == 0)
        {
            maxim = 0;
            query(1, 1, n);
            printf("%d\n", maxim);
        }
        else
        {
            poz = a; val = b;
            update(1, 1, n);
        }
    }
    return 0;
}