#include <iostream>
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
const int maxn = 100005;
int arbint[maxn * 4];

/// update (nod, st, dr, poz, x) = suntem in nodul nod care reprezinta [st, dr] si vrem sa punem x pe pozitia poz

/// query (nod, st, dr, x, y) = suntem in nodul nod ce reprezinta [st, dr] si vrem sa gasim maximul intre [x, y]


void update(int nod, int st, int dr, int poz, int x)
{
    if(!(st <= poz && poz <= dr)) /// daca x nu este in intervalul [st, dr], ma opresc
        return;
    if(st == dr)
    {
        arbint[nod] = x;
        return;
    }
    int mij = (st + dr) / 2;
    update(nod * 2, st, mij, poz, x);
    update(nod * 2 + 1, mij + 1, dr, poz, x);
    arbint[nod] = max(arbint[nod * 2], arbint[nod * 2 + 1]);
}

int query(int nod, int st, int dr, int x, int y)
{
    if(y < st || x > dr)
        return 0;
    if(x <= st && dr <= y)
        return arbint[nod];
    int mij = (st + dr) / 2;
    int raspuns_stanga = query(nod * 2, st, mij, x, y);
    int raspuns_dreapta = query(nod * 2 + 1, mij + 1, dr, x, y);
    return max(raspuns_stanga, raspuns_dreapta);
}

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        int x;
        in >> x;
        update(1, 1, n, i, x);
    }
    for(int i = 1; i <= m; i++)
    {
        int op, a, b;
        in >> op >> a >> b;
        if(op == 0) /// trebuie sa gasesc maximul din [a, b]
            out << query(1, 1, n, a, b) << "\n";
        else /// trebuie sa pun b pe pozitia a
            update(1, 1, n, a, b);
    }
    return 0;
}