#include <bits/stdc++.h>

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

void build(int node, int l, int r) {
    if (l == r) {
        t[node] = v[l];
        return;
    }

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

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

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

    if (l >= a && r <= b) {
        return t[node];
    }
    int m = (l + r) / 2;

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

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

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

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

    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, 1, n);

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