#include <fstream>
#define nmax 100001
#define mid (left+right)/2
using namespace std;
ifstream is ("arbint.in");
ofstream os ("arbint.out");

int Arb[4*nmax], N, M, ANSW;
int type, val, pos, L, R;
void Read();
void Update(int,int,int);
void Query(int,int,int);

int main()
{
    Read();
    for(int i = 1; i <= M; ++i)
    {
        is >> type;
        switch(type) {
            case 0:
                is >> L >> R;
                Query(1,1,N);
                os << ANSW << "\n";
                ANSW = 0;
                break;
            case 1:
                is >> pos >> val;
                Update(1,1,N);
                break;
        }
    }
    is.close();
    os.close();
    return 0;
}
void Read()
{
    is >> N >> M;
    for(int i = 1; i <= N; ++i)
    {
        is >> val;
        pos = i;
        Update(1, 1, N);
    }
}
void Update(int node, int left, int right)
{
    if(left == right)
    {
        Arb[node] = val;
        return;
    }

    if(pos <= mid) Update(2*node, left, mid);
    else Update(2*node+1, mid+1, right);

    Arb[node] = max(Arb[2*node], Arb[2*node+1]);
}
void Query(int node, int left, int right)
{
    if(left >= L && right <= R)
    {
        ANSW = max(ANSW, Arb[node]);
        return;
    }
    if(mid >= L) Query(2*node, left, mid);
    if(mid < R) Query(2*node+1, mid+1, right);
}