#include <iostream>
#include <fstream>

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

int n, m;
int arr[100001];
int segment_tree[400001];

int task, a, b;

void build(int nod, int left, int right)
{
    if(left == right)
        segment_tree[nod] = arr[left];
    else
    {
        int m = (left + right) / 2;
        build(nod*2, left, m);
        build(nod*2+1, m+1, right);
        segment_tree[nod] = max(segment_tree[nod*2], segment_tree[nod*2+1]);
    }
}

void update(int nod, int left, int right, int pos, int new_value)
{
    if(left == right)
        segment_tree[nod] = new_value;
    else
    {
        int m = (left + right) / 2;
        if(pos <= m)
            update(nod*2, left, m, pos, new_value);
        else
            update(nod*2+1, m+1, right, pos, new_value);
        segment_tree[nod] = max(segment_tree[nod*2], segment_tree[nod*2+1]);
    }
}

int query(int nod, int left, int right, int q_left, int q_right)
{
    if(q_left <= left && right <= q_right)
        return segment_tree[nod];
    else
    {
        int m = (left + right)/2;
        if(q_right <= m)
            return query(nod*2, left, m, q_left, q_right);
        if(m+1<=q_left)
            return query(nod*2+1, m+1, right, q_left, q_right);
        return max(query(nod*2, left, m, q_left, q_right), query(nod*2+1, m+1, right, q_left, q_right));
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        fin >> arr[i];
    build(1, 1, n);
    while(m--)
    {
        fin >> task >> a >> b;
        if(!task)
            fout << query(1, 1, n, a, b) << '\n';
        else
            update(1, 1, n, a, b);
    }
    return 0;
}