#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int A[40001];
void actualizare(int nod, int left, int right, int poz, int x)
{
    if(poz < left || poz > right)
        return;
    if(left == right)
    {
     A[nod] = x;
     return;
    }
    actualizare(nod * 2, left, (left + right) / 2, poz, x);
    actualizare(nod * 2 + 1, (left + right) / 2 + 1, right, poz, x);
    A[nod] = max(A[nod * 2], A[nod * 2 + 1]);
}
int maxi(int nod, int left, int right, int st, int dr)
{
    if(dr < left || st > right)
        return 0;
    if(st <= left && dr >= right)
        return A[nod];
    return max(maxi(nod * 2, left, (right + left) / 2, st , dr), maxi(nod * 2 + 1, (left + right) / 2 + 1, right, st, dr));
}
int main()
{
    int n, m, instr, a, b;
    f >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        f >> a;
        actualizare(1, 1, n, i, a);
    }

    //for(int i = 1; i <= 2 * n - 1; i++)
    //    g << A[i] << " ";
    //g << "\n";

    for(int j = 0; j < m; j++)
    {
        f >> instr >> a >> b;
        if(instr == 1)
            actualizare(1, 1, n, a, b);
        if(instr == 0)
        {
            g << maxi(1, 1, n, a, b) <<"\n";
        }
    }
}