#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int N, M, array[100005], segment_tree[400020];
void build(int node, int left, int right)
{
    if (left == right)
    {
        segment_tree[node] = array[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] = 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 max(query(node * 2, left, middle, query_left, query_right), query(node * 2 + 1, middle + 1, right, query_left, query_right));
    }
}
int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
        fin >> array[i];
    build(1, 1, N);
    for (int i = 1; i <= M; i++)
    {
        int cmd, x, y;
        fin >> cmd >> x >> y;
        if (cmd == 0)
            fout << query(1, 1, N, x, y) << endl;
        else
            update(1, 1, N, x, y);
    }
    return 0;
}