#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int N = 1e5 + 5;
struct Segtree {
    struct node {
        int x;
        node(int x = 0) : x(x) {}
        friend node merge(const node& l, const node& r) {
            return node(max(l.x, r.x));
        }
    };
    int n;
    vector <node> t;
    template <typename Iterator>
    void build(Iterator first, Iterator last) {
        n = distance(first, last);
        t.resize(2 * n);
        int i = n;
        for(auto it = first; it != last; ++it, ++i) {
            t[i] = node(*it);
        }
        for(int i = n - 1; i >= 1; --i) {
            t[i] = merge(t[i << 1], t[i << 1 | 1]);
        }
    }
    void update(int pos, node val) {
        t[pos + n] = val;
        for(int i = pos + n; i > 1; i >>= 1) {
            t[i >> 1] = merge(t[i & -2], t[i | 1]);
        }
    }
    node query(int l, int r) { /// [l, r)
        node ansl, ansr;
        for(l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if(l & 1) ansl = merge(ansl, t[l++]);
            if(r & 1) ansr = merge(ansr, t[--r]);
        }
        return merge(ansl, ansr);
    }
};

// #define HOME
int a[N];

int main() {
#ifndef HOME
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");
#endif
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    Segtree S;
    S.build(a, a + n);
    for(int i = 0; i < m; i++) {
        int t, a, b;
        cin >> t >> a >> b;
        if(t == 1) {
            S.update(a-1, Segtree::node(b));
        } else {
            cout << S.query(a-1, b).x << "\n"; /// [a-1, b) <=> [a-1, b-1]
        }
    }
    return 0;
}