#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(v) begin(v), end(v)
#define al(v, l, r) begin(v) + l, begin(v) + r + 1
#define sz(v) (int)v.size()
#define pb push_back
#define pob pop_back
#define fs first
#define sd second

constexpr int inf = 2e9;
constexpr ll infll = 4e18;
constexpr int N = 1e5 + 5;

int n, q, a[N];

struct aint {
    int tr[4 * N];

    void build(int nod, int l, int r) {
        if (l == r) {
            tr[nod] = a[l];
            return;
        }

        int mij = l + ((r - l) >> 1);
        build(nod << 1, l, mij);
        build(nod << 1 | 1, mij + 1, r);
        tr[nod] = max(tr[nod << 1], tr[nod << 1 | 1]);
    }

    void update(int nod, int l, int r, int p, int x) {
        if (l == r) {
            tr[nod] = x;
            return;
        }

        int mij = l + ((r - l) >> 1);

        if (p <= mij) {
            update(nod << 1, l, mij, p, x);
        } else {
            update(nod << 1 | 1, mij + 1, r, p, x);
        }

        tr[nod] = max(tr[nod << 1], tr[nod << 1 | 1]);
    }

    int query(int nod, int l, int r, int a, int b) {
        if (b < l || r < a) {
            return 0;
        }

        if (a <= l && r <= b) {
            return tr[nod];
        }

        int mij = l + ((r - l) >> 1);
        return max(query(nod << 1, l, mij, a, b), query(nod << 1 | 1, mij + 1, r, a, b));
    }
};

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    cin >> n >> q;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }

    aint seg;
    seg.build(1, 1, n);

    for (int _ = 0, t, a, b; _ < q; ++_) {
        cin >> t >> a >> b;

        if (t == 0) {
            cout << seg.query(1, 1, n, a, b) << "\n";
        } else {
            seg.update(1, 1, n, a, b);
        }
    }
}