#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

const int N = 1e5 + 10;
int t[4 * N];
void modif(int i, int l, int r, int pos, int val) {
    if(l > pos || r < pos) return;
    if(l == pos && r == pos) {
        t[i] = val;
        return;
    }
    int mid = l + r >> 1;
    modif(2 * i, l, mid, pos, val);
    modif(2 * i + 1, mid + 1, r, pos, val);
    t[i] = max(t[2 * i], t[2 * i + 1]);
}
int query(int i, int l, int r, int tl, int tr) {
    if(l > tr || r < tl) return 0;
    if(l >= tl && r <= tr) return t[i];
    int mid = l + r >> 1;
    return max(query(2 * i, l, mid, tl, tr), query(2 * i + 1, mid + 1, r, tl, tr));
}

void solve() {
    int n, q;
    cin >> n >> q;
    forn(i, n) {
        int x; cin >> x;
        modif(1, 0, n - 1, i, x);
    }
    while (q--) {
        int type, a, b;
        cin >> type >> a >> b;
        if(!type) {
            --a, --b;
            cout << query(1, 0, n - 1, a, b) << "\n";
        } else {
            --a;
            modif(1, 0, n - 1, a, b);
        }
    }
} 
 
int32_t main() {
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}