#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

const int MaxN = 100050;
int n, m;
int pos, maxim, val, start, fin;
int a[4*MaxN];

void Query(int node, int left, int right);
void Update(int node, int left, int right);

int main()
{
    is >> n >> m;
    int op;
    int x, y;
    for(int i = 1; i <= n ;++i)
    {
        is >> x;
        pos = i;
        val = x;
        Update(1, 1, n);
    }

    for(int i = 1; i <= m; ++i)
    {
        is >> op >> x >> y;
        if(op == 0)
        {
            maxim = -1;
            start = x;
            fin = y;
            Query(1, 1, n);
            os << maxim << '\n';
        }
        if(op == 1)
        {
            pos = x;
            val = y;
            Update(1, 1, n);
        }
    }
    is.close();
    os.close();
    return 0;

}

void Update(int node, int left, int right)
{
    if(left == right)
    {
        a[node] = val;
        return;
    }
    int mij = (left + right)/2;
    if(pos <= mij) Update(node*2, left, mij);
    else           Update(node*2 +1, mij+1, right);

    a[node] = max(a[2*node], a[2*node+1]);

}

void Query(int node, int left, int right)
{

    if(start <= left && right <= fin)
    {
        if(maxim < a[node]) maxim = a[node];
        return;
    }
    int mij = (left + right) /2;
    if( start <= mij) Query(2*node, left, mij);
    if( mij < fin) Query(2*node+1, mij +1, right);
}