#include <iostream>
#include <fstream>
#define dim 100001
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
int N,M;
int MaxArb[4*dim+66];
int start,finish,Val,Pos,maxim;

int Maxim (int a,int b)
{
    if (a>b) return a;
    return b;
}
void Update(int,int,int);
void Querry(int,int,int);

int main()
{
    int i;
    int X,A,B;
    fin>>N>>M;
    for (i=1;i<=N;i++)
    {
        fin>>X;
        Pos=i;
        Val=X;
        Update(1,1,N);
    }
    for (i=1;i<=M;i++)
    {
        fin>>X>>A>>B;
        if (X==0)
        {
            maxim=-1;
            start=A;
            finish=B;
            Querry(1,1,N);
            fout<<maxim<<"\n";
        }
        else
        {
            Pos=A;
            Val=B;
            Update(1,1,N);
        }
    }
    return 0;
}
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 Querry (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) Querry(2*nod,left,div);
    if (div<finish) Querry(2*nod+1,div+1,right);
}