/*#include <iostream>
#include <fstream>
#define fin "arbint.in"
#define fou "arbint.out"
#define Max 100001
using namespace std;
ifstream t1(fin);
ofstream t2(fou);
int Arb[4*Max+66],n,m,poz,val,start,finish,maxim;

int Maxim(int a,int b)
{
    if(a>b) return a;
    else return b;
}

void update(int nod,int st, int dr)
{
    if(st==dr)
    {
        Arb[nod]=val;
        return;
    }
    int div=(st+dr)/2;
    if(poz<=div) update(2*nod,st, div);
           else update(2*nod+1,div+1,dr);
    Arb[nod]=Maxim(Arb[nod*2],Arb[nod*2+1]);
}

void query(int nod, int st, int dr)
{
    if(start<=st && dr<=finish)
    {
        if(maxim<Arb[nod]) maxim=Arb[nod];
        return;
    }

    int div=(st+dr)/2;
    if(start<=div) query(2*nod,st,div);
    if(finish>div) query(2*nod+1,div+1,dr);
}

int main()
{
    int i,x,tip,a,b;
    t1>>n>>m;
    for(i=1;i<=n;i++)
    {
        t1>>x;
        poz=i; val=x;
        update(1,1,n);
    }
    for(i=1;i<=n;i++)
    {
        t1>>tip>>a>>b;
        if(tip==0)
        {
            maxim=-1; start=a; finish=b;
            query(1,1,n);
            t2<<maxim<<'\n';
        }
        if(tip==1)
        {
            poz=a; val=b;
            update(1,1,n);
        }
    }
    t1.close();
    t2.close();
    return(0);
}*/

#include <stdio.h>
#include <fstream>
#include <assert.h>
using namespace std;

#define in "arbint.in"
#define out "arbint.out"
#define dim 100001

int N, M;
int MaxArb[4*dim+66];
int start, finish, Val, Pos, maxim;

inline int Maxim(int a, int b) {
       if ( a > b ) return a;
       return b;
}

void Update(int,int,int);
void Query(int,int,int);

int main()
{
    int X, A, B;
    freopen(in,"r",stdin);
    freopen(out,"w",stdout);

    scanf("%d%d", &N, &M);
    for ( int i = 1; i <= N; i++ )
    {
        scanf("%d", &X);
        Pos = i, Val = X;
        Update(1,1,N);
    }

    for ( int i = 1; i <= M; i++ )
    {
        scanf("%d%d%d", &X, &A, &B);
        if ( X == 0 )
        {
             maxim = -1;
             start = A, finish = B;
             Query(1,1,N);

             printf("%d\n", maxim);
        }
        else
        {
            Pos = A, Val = B;
            Update(1,1,N);
        }
    }
}

void Update(int nod, int left, int right)
{
     if ( left == right )
     {
          MaxArb[nod] = Val;
          return;
     }

     int div = (left+right)/2;
     if ( Pos <= div ) Update(2*nod,left,div);
     else              Update(2*nod+1,div+1,right);

     MaxArb[nod] = Maxim( MaxArb[2*nod], MaxArb[2*nod+1] );
}

void Query(int nod, int left, int right)
{
     if ( start <= left && right <= finish )
     {
          if ( maxim < MaxArb[nod] ) maxim = MaxArb[nod];
          return;
     }

     int div = (left+right)/2;
     if ( start <= div ) Query(2*nod,left,div);
     if ( div < finish ) Query(2*nod+1,div+1,right);
}