#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int N,M;
int MaxArb[4*NMAX+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 Query(int,int,int);
int main()
{
    int x,A,B;
    fin>>N>>M;
    for(int i=1;i<=N;++i)
    {
        fin>>x;
        Pos=i;
        Val=x;
        Update(1,1,N);
    }
    for(int i=1;i<=M;++i)
    {
        fin>>x>>A>>B;
        if(x==0) //max din intervalul [A,B]
        {
            maxim=-1;
            start=A, finish=B;
            Query(1,1,N);
            fout<<maxim<<"\n";
        }
        else{    //schimb val de pe poz a cu b
            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 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);
}