#include <fstream>
#include <algorithm>
#define w 100001
using namespace std;
int a,b;
int v[w];
int val[w];
int make(int i, int x, int y)
{
    if (x==y)
    {
        val[i]=v[x];
        return v[x];
    }
    int mid=(x+y)/2;
    val[2*i]=make(2*i,x,mid);
    val[2*i+1]=make(2*i+1,mid+1,y);
    val[i]=max(val[2*i],val[2*i+1]);
    return val[i];
}
int put(int i,int x,int y)
{
    if (x==y&&x==a)
    {
        val[a]=b;
        return b;
    }
    int mid=(x+y)/2;
    if (a<=mid)
    {
        val[2*i]=put(2*i,x,mid);
    }
    if (a>mid)
    {
        val[2*i+1]=put(2*i+1,mid+1,y);
    }
    val[i]=max(val[2*i],val[2*i+1]);
    return val[i];
}
int maxn(int i,int x,int y)
{
    if (b<x||y<a) return -1;
    if (a<=x&&y<=b) return val[i];
    int mid=(x+y)/2;
    return max(maxn(2*i,x,mid),maxn(2*i+1,mid+1,y));
}
int main()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");
    int i,n,m,ok;
    f>>n>>m;
    for (i=1;i<=n;i++)
        f>>v[i];
    make(1,1,n);
    for (i=1;i<=m;i++)
    {
        f>>ok>>a>>b;
        if (ok) put(1,1,n);
        else g<<maxn(1,1,n)<<'\n';
    }
    f.close();
    g.close();
    return 0;
}