#include <fstream>

using namespace std;

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

inline void update (unsigned int node, unsigned int left, unsigned int right);
inline void query (unsigned int node, unsigned int left, unsigned int right);

unsigned int N, M;
unsigned int A;
bool type;
unsigned int a, b;

unsigned maxArb[400001];
unsigned int pos, val, start, finish;
int maximum;
unsigned int i;

int main ()
{
    fin >> N >> M;
    for (i=1; i<=N; i++)
    {
        fin >> A;
        pos = i;
        val = A;
        update(1,1,N);
    }
    for (i=1; i<=M; i++)
    {
        fin >> type >> a >> b;
        if (type == 0)
        {
            maximum = -1;
            start = a;
            finish = b;
            query(1,1,N);
            fout << maximum << '\n';
        }
        else
        {
            pos = a;
            val = b;
            update(1,1,N);
        }
    }
    return 0;
}

inline void update (unsigned int node, unsigned int left, unsigned int right)
{
    unsigned int mid;
    if (left == right)
    {
        maxArb[node] = val;
        return;
    }
    mid = (left+right)/2;
    if (pos <= mid)
        update(2*node,left,mid);
    else
        update(2*node+1,mid+1,right);
    maxArb[node] = max(maxArb[2*node],maxArb[2*node+1]);
}

inline void query (unsigned int node, unsigned int left, unsigned int right)
{
    unsigned int mid;
    if (start<=left && right<=finish)
    {
        if (maxArb[node] > maximum)
            maximum = maxArb[node];
        return;
    }
    mid = (left+right)/2;
    if (start <= mid)
        query(2*node,left,mid);
    if (mid < finish)
        query(2*node+1,mid+1,right);
}