#include <cstdio>
using namespace std;

int maxim, v[1000005];
int MyMax(int a, int b)
{
    if (a > b)
        return a;
    return b;
}

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

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

void query(int nod, int st, int dr, int a, int b)
{
    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, a, b);
    if (div < b)
        query(2 * nod + 1, div + 1, dr, a, b);
}
int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int n, m, x, tip, a, b;

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

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

    }
    return 0;
}