#include <fstream>

using namespace std;
int v[100005];
int aint[400005];
void build (int l, int r, int cr)
{
    if (l==r)
    {
        aint[cr]=v[l];
        //cout<<aint[cr]<<" ";
        return;
    }
    int mid=(l+r)/2;
    build (l, mid, 2*cr);
    build (mid+1, r, 2*cr+1);
    aint[cr]=max(aint[2*cr], aint[2*cr+1]);
    return;
}
int join(int a, int b)
{
    return max(a, b);
}
void update(int l, int r, int poz, int val, int cr)
{
    if (l>poz||r<poz)
        return;
    if (l==r)
    {
        aint[cr]=val;
        return;
    }
    int mid=(l+r)/2;
    update(l, mid, poz, val, 2*cr);
    update(mid+1, r, poz, val, 2*cr+1);
    aint[cr]=join(aint[2*cr], aint[2*cr+1]);
}
void printaint(int n)
{
    for (int i=1; i<=4*n; i++)
    {
        //cout<<aint[i]<<" ";
    }
    return;
}
int query(int l, int r, int st, int dr, int cr)
{
    if (st<=l&&r<=dr)
        return aint[cr];
    int mid=(l+r)/2;
    if (mid<st)
        return query(mid+1, r, st, dr, 2*cr+1);
    if (dr<=mid)
        return query(l, mid, st, dr, 2*cr);
    return join(query(l, mid, st, dr, 2*cr), query(mid+1, r, st, dr, 2*cr+1));
}
int main()
{
    ifstream cin ("arbint.in");
    ofstream cout ("arbint.out");
    int n, m, cer, a, b;
    cin>>n>>m;
    for (int i=1; i<=n; i++)
    {
        cin>>v[i];
    }
    build(1, n, 1);
    for (int i=0; i<m; i++)
    {
        cin>>cer>>a>>b;
        if (cer==0)
        {
            cout<<query(1, n, a, b, 1)<<'\n';
        }
        else
        {
            update(1, n, a, b, 1);
            //cout<<"MORBYDOMPY";
            printaint(n);
        }
    }
}