#include <bits/stdc++.h>

using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n, m, op, a, b;
int t[400005];
int v[100005];

void build(int l, int r, int node) {
    if (l > r) {
        return;
    }

    if (l == r) {
        t[node] = v[l];
        return;
    }

    int m = (l + r) / 2;
    build(l, m, 2 * node);
    build(m + 1, r, 2 * node + 1);

    t[node] = max(t[2 * node], t[2 * node + 1]);
}

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

    if (l >= a && r <= b) {
        return t[node];
    }

    int m = (l + r) / 2;
    return max(query(l, m, a, b, 2 * node), query(m + 1, r, a, b, 2 * node + 1));
}

void update(int l, int r, int pos, int val, int node) {
    if (l > r) {
        return;
    }

    if (l == r) {
        t[node] = val;
        return;
    }

    int m = (l + r) / 2;
    if (pos <= m) {
        update(l, m, pos, val, 2 * node);
    } else {
        update(m + 1, r, pos, val, 2 * node + 1);
    }

    t[node] = max(t[2 * node], t[2 * node + 1]);
}
int main() {

    in >> n >> m;
    for (int i = 1; i <= n; i++) {
        in >> v[i];
    }

    build(1, n, 1);

    for (int i = 0; i < m; i++) {
        in >> op >> a >> b;
        if (op == 0) {
            out << query(1, n, a, b, 1) << '\n';
        } else {
            update(1, n, a, b, 1);
        }
    }
    return 0;
}