#include <bits/stdc++.h>
#define NMAX 100000

using namespace std;
ifstream fi("arbint.in");
ofstream fo("arbint.out");
int n,m;
int X[NMAX+5],SGT[4*NMAX];

void update(int nod, int st, int dr, int pos, int val)
{
    if(st==dr)
    {
        SGT[nod]=val;
        return;
    }
    int mid=(st+dr)/2;
    int nnod=2*nod;
    if(pos<=mid)
        update(nnod, st, mid, pos, val);
    else
        update(nnod+1, mid+1, dr, pos, val);
    SGT[nod]=max(SGT[nnod],SGT[nnod+1]);
}

int maxim(int nod, int st, int dr, int a, int b)
{
    if(a<=st && b>=dr)
        return SGT[nod];
    if(a>dr || b<st)
        return 0;
    int mid=(st+dr)/2;
    int nnod=2*nod;
    return max(maxim(nnod, st, mid, a, b), maxim(nnod+1, mid+1, dr, a, b));
}

void citire_vector(void)
{
    fi>>n>>m;
    for(int i=1; i<=n; i++)
    {
        fi>>X[i];
        update(1,1,n,i,X[i]);
    }
}

void rezolvare_query(void)
{
    int q,a,b;
    while(m--)
    {
        fi>>q>>a>>b;
        if(q==0)
            fo<<maxim(1, 1, n, a, b)<<"\n";
        else
            update(1, 1, n, a, b);
    }
}

int main()
{
    citire_vector();
    rezolvare_query();
    fi.close();
    fo.close();
    return 0;
}