#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("arbint.in");
ofstream g ("arbint.out");
int n,m,mx_rasp;
int x, arbore[400001];
void adaugare(int x,int indice_v,int indice_arb,int st,int dr)
{
    if(st == dr)
    {
        arbore[indice_arb] = x;
        return;
    }
    int mij = (st+dr)/2;
    if(indice_v<=mij)
    {
        adaugare(x,indice_v,indice_arb*2,st,mij);
    }
    else
        adaugare(x,indice_v,indice_arb*2+1,mij+1,dr);
    arbore[indice_arb] = max(arbore[indice_arb*2],arbore[indice_arb*2+1]);
}
void query(int st_int,int dr_int,int st,int dr,int indice_arb)
{
    if(dr_int>=dr && st_int<=st)
    {
        mx_rasp = max(mx_rasp,arbore[indice_arb]);
        return;
    }
    int mij = (st+dr)/2;
    if(st_int<=mij)
    {
        query(st_int,dr_int,st,mij,indice_arb*2);
    }
    if(dr_int>mij)
    {
        query(st_int,dr_int,mij+1,dr,indice_arb*2+1);
    }
}
int main()
{
    f >> n>>m;
    for(int i = 1;i<=n;i++)
    {
        f >> x;
        adaugare(x,i,1,1,n);
    }
    cout <<arbore[1]<< endl;
    cout <<arbore[2]<< " "<<arbore[3]<< endl;
    for(int i = 4;i<=7;i++)
        cout << arbore[i]<< " ";
    for(int i = 1;i<=m;i++)
    {
        int c,a,b;
        f >> c >> a >> b;
        if(c == 0)
        {
            mx_rasp =0;
            query(a,b,1,n,1);
            g << mx_rasp<<'\n';
        }
        else
            adaugare(b,a,1,1,n);
    }
}