#include <bits/stdc++.h>
#define lim 100005
#define mx 10000000000
using namespace std;

ifstream in("arbint.in");
ofstream out("arbint.out");

int n, m, v[lim], q[lim*10];

void read()
{
    in>>n>>m;
    for(int i=0; i<n; ++i)
    {
        in>>v[i];
    }
}

int create_rmq_tree(int inc, int sf, int pos)
{
    if(inc==sf)
    {
        q[pos]=v[inc];
        return 0;
    }
    int mid=(inc+sf)/2;
    create_rmq_tree(inc, mid, 2*pos+1);
    create_rmq_tree(mid+1, sf, 2*pos+2);
    q[pos]=max(q[2*pos+1], q[2*pos+2]);
}

int minimum(int inc, int sf, int iinc, int isf, int pos)
{
    if(iinc<=inc && isf>=sf)
        return q[pos];
    if(iinc>sf || isf<inc)
        return 0;
    int mid=(inc+sf)/2;
    return max(minimum(inc, mid, iinc, isf, 2*pos+1), minimum(mid+1, sf, iinc, isf, 2*pos+2));
}

void solve()
{
    create_rmq_tree(0, n-1, 0);
    for(int i=1; i<=m; ++i)
    {
        int a, b, c;
        in>>a>>b>>c;
        if(a==0)
        {
            out<<minimum(0,n-1, b-1, c-1, 0)<<'\n';
        }
        else if(a==1)
        {
            v[b-1]=c;
            create_rmq_tree(0, n-1, 0);
        }
    }
}

int main()
{
    read();
    solve();
    return 0;
}