#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
void bruteForce()
{
    int A[100004],j = 1 ,a,b,tip,n,m;
    in >> n >> m;
    while(n--)
        in >> A[j++];
    while(m--)
    {
        in >> tip  >> a >> b;
        if(tip)
            A[a] = b;
        else
            out << *max_element(A+a,A+b+1,[](int a, int b){return a<b;}) << '\n';
    }
}
int main()
{
    bruteForce();
    return 0;
}