#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("arbint.in");
ofstream g ("arbint.out");
int n,m,mx;
int arbore[400001];
void adaugare(int x,int indice,int st,int dr,int indicearbore)
{
    if(st==dr)
    {
        arbore[indicearbore] =x;
        return;
    }
    int mij = (st+dr)/2;
    if(indice<=mij)
    {
        adaugare(x,indice,st,mij,indicearbore*2);
    }
    else
        adaugare(x,indice,mij+1,dr,indicearbore*2+1);
    arbore[indicearbore] = max(arbore[indicearbore*2],arbore[indicearbore*2+1]);
}
void maxim(int st,int dr,int st_arb,int dr_arb,int indice_arb)
{
    if(st<=st_arb&&dr_arb<=dr)
        {
            mx = max(mx,arbore[indice_arb]);
            return;
        }
    int mij = (st_arb+dr_arb)/2;
    if(st<=mij)
    {
        maxim(st,dr,st_arb,mij,indice_arb*2);
    }
    if(dr>mij)
    {
        maxim(st,dr,mij+1,dr_arb,indice_arb*2+1);
    }
}
int main()
{
    f >> n>> m;
    for(int i = 1;i<=n;i++)
    {
        int x;
        f >> x;
        adaugare(x,i,1,n,1);
    }
    for(int i =1;i<=m;i++)
    {
        int c,a,b;
        f >> c>> a>> b;
        if(c==1)
            adaugare(b,a,1,n,1);
        else
            {
                mx = 0;
                maxim(a,b,1,n,1);
                g << mx<<'\n';
            }
    }
}