//
//  main.cpp
//  Arbint
//
//  Created by Andrada Minca on 20.11.2025.
//

#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
const int N = 100005;
int segment_tree[N*4], aray[N];
void build(int node, int left, int right)
{
    if (left == right)
    {
        segment_tree[node] = aray[left];
    }
    else
    {
        int middle = (left + right) / 2;
        build(node * 2, left, middle);
        build(node * 2 + 1, middle + 1, right);
        segment_tree[node] = max(segment_tree[node * 2],
        segment_tree[node * 2 + 1]);

    }
}
void update(int node, int left, int right, int position, int new_value)
{
    if (left == right)
    {
        segment_tree[node] = new_value;
    }
    else
    {
        int middle = (left + right) / 2;
        if (position <= middle)
        update(node * 2, left, middle, position, new_value);
        else
        update(node * 2 + 1, middle + 1, right, position, new_value);
        segment_tree[node] = std::max(segment_tree[node * 2],
        segment_tree[node * 2 + 1]);

    }
}
int query(int node, int left, int right, int query_left, int query_right)
{
    if (query_left <= left and right <= query_right)
    {
        return segment_tree[node];
    }
    else
    {
        int middle = (left + right) / 2;

        if (query_right <= middle)
          return query(node * 2, left, middle, query_left, query_right);
        if (middle + 1 <= query_left)
          return query(node * 2 + 1, middle + 1, right, query_left, query_right);

        return std::max(query(node * 2, left, middle, query_left, query_right),
                        query(node * 2 + 1, middle + 1, right, query_left, query_right));
    }
}

int main()
{
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;++i)cin>>aray[i];
    build(1,1,n);
    while (q--)
    {
        int t;
        cin>>t;
        if(t==0)
        {
          int left, right;
          cin>>left>>right;
          cout<<query(1,1,n,left,right)<<"\n";
        }
        else
        {
          int position,new_value;
          cin>>position>>new_value;
          update(1,1,n,position,new_value);
        }
    }
    return 0;
}