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