#include <cstdio>
#include <iostream>

using namespace std;

const int nmx = 400002;

int a,b,n,m,maxim,arb[nmx];

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

    int mij = (st + dr) / 2;

    if(a <= mij)
        update(st,mij,2*nod);
    else
        update(mij+1,dr,2*nod+1);

    arb[nod] = max(arb[2*nod],arb[2*nod+1]);

    return;
}

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

    int mij = (st + dr) / 2;

    if(a <= mij)
        look(st,mij,2*nod);
    if(b > mij)
        look(mij+1,dr,2*nod+1);

    return;
}

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

    scanf("%d %d", &n, &m);
    for(a = 1; a <= n; ++a)
    {
        scanf("%d", &b);
        update(1,n,1);
    }

    for(int i = 1; i <= m; ++i)
    {
        int c;
        scanf("%d %d %d", &c, &a, &b);

        if(not c)
        {
            maxim = 0;
            look(1,n,1);
            printf("%d\n", maxim);
        }
        else
            update(1,n,1);
    }

    return 0;
}