#include<bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
#define ll long long
const ll NMAX = 1e5;
vector<ll> a(NMAX + 1);
vector<ll> segment_tree(4 * NMAX + 5);
void AINT(ll node, ll left, ll right){
    if(left == right){
       segment_tree[node] = a[left];
    }
    else{
        ll mid = (left + right) / 2;
        AINT(2 * node, left, mid);
        AINT(2 * node + 1, mid + 1, right);
        segment_tree[node] = max(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}
void update(ll node, ll left, ll right, ll pos, ll value){
    if(left == right){
        segment_tree[node] = value;
    }
    else{
        ll mid = (left + right) / 2;
        if(mid >= pos){
            update(2 * node, left, mid, pos, value);
        }
        else{
            update(2 * node + 1, mid + 1, right, pos, value);
        }
        segment_tree[node] = max(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}
ll query(ll node, ll left, ll right, ll left_query, ll right_query){
    if(left_query <= left && right <= right_query){
       return segment_tree[node];
    }
    else{
        ll mid = (left + right) / 2;
        if(mid + 1 <= left_query){
            return query(2 * node + 1, mid + 1, right, left_query, right_query);
        }
        if(mid >= right_query){
            return query(2 * node, left, mid, left_query, right_query);
        }
        return max(query(2 * node + 1, mid + 1, right, left_query, right_query), query(2 * node, left, mid, left_query, right_query));
    }
}
int main(){
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
    }
    AINT(1, 1, n);
    for(int i = 0; i < m; i++){
        int request, a, b;
        fin >> request >> a >> b;
        if(request == 0){
           fout << query(1, 1, n, a, b) << '\n';
        }
        else{
            update(1, 1, n, a, b);
        }
    }
    return 0;
}