#include <bits/stdc++.h>
#define N 1000005

using namespace std;

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

int M, n, i, tip, a, b, poz, val, t[N];

void actualizare(int p,int st,int dr)
{
    if(st == dr)
    {
        t[p] = val;
        return;
    }
    int m =(st+dr)/2;
    if(poz <= m){
        actualizare(2*p, st, m);
    }
    else{
        actualizare(2*p+1, m+1, dr);
    }
    t[p] = max(t[2*p],t[2*p+1]);
}
int interogare(int p, int st, int dr)
{
    if(a <= st && dr <= b){
        return t[p];
    }
    int m = (st+dr)/2, rst = 0, rdr = 0;
    if(a <= m){
        rst = interogare(2*p, st, m);
    }
    if(m < b){
        rdr = interogare(2*p+1, m+1, dr);
    }
    return max(rst,rdr);
}
int main()
{
    in >> n >> M;
    for(i = 1; i <= n; i++)
    {
        in >> val;
        poz = i;
        actualizare(1, 1, n);
    }
    for(i = 1; i <= M; i++)
    {
        in >> tip >> a >> b;
        poz = a;
        val = b;
        if(tip == 0){
            out << interogare(1, 1, n) << '\n';
        }
        else{
            actualizare(1, 1, n);
        }
    }
    return 0;
}