#include <fstream>
#define INF 2000000000
#define DIM 100002

using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

int a, b, n, m, i, q, v[DIM], arb[2 * DIM], sol;

void build(int nod, int st, int dr)
{
    if(st == dr)
        arb[nod] = v[st];
    else
    {
        int mid = (st + dr) / 2;
        build(2 * nod, st, mid);
        build(2 * nod + 1, mid + 1, dr);
        arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
    }
}

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

}

void query(int nod, int st, int dr, int a, int b)
{
    if(a <= st && b >= dr)
        sol = max(sol, arb[nod]);
    else
    {
        int mid = (st + dr) / 2;
        if(a <= mid)
            query(2 * nod, st, mid, a, b);
        if(b > mid)
            query(2 * nod + 1, mid + 1, dr, a, b);
    }

}

int main()
{
    f>>n>>m;
    for(i = 1;i <= n; ++ i)
        f>>v[i];

    build(1, 1, n);

    for(i = 1;i <= m; ++ i)
    {
        f>>q>>a>>b;
        if(q == 0)
        {
            sol = - INF;
            query(1, 1, n, a, b);
            g<<sol<<'\n';
        }
        else
            update(1, 1, n, a, b);
    }
    return 0;
}