#include <iostream>
#include <fstream>
using namespace std;

ifstream in("arbint.in");
ofstream out("arbint.out");

int n, m, v[100005];
int tree[200005];

void citire();
void build(int, int, int);
void update(int, int, int, int, int);
int query(int, int, int, int, int);


int main() {

    citire();
    build(1, 1, n);

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

    return 0;
}


int query(int n, int start, int end, int l, int r) {
    if (r < start || l > end) return 0;
    if (l <= start && r >= end) return tree[n];

    int mid = (start + end) / 2;
    int m1 = query(n * 2, start, mid, l, r);
    int m2 = query(n * 2 + 1, mid + 1, end, l, r);
    return max(m1, m2);
}

void update(int n, int start, int end, int idx, int val) {
    if (start == end) {
        v[idx] = val;
        tree[n] = val;
        return;
    }

    int mid = (start + end) / 2;
    if (idx <= mid) {
        update(n * 2, start, mid, idx, val);
    } else {
        update(n * 2 + 1, mid + 1, end, idx, val);
    }

    tree[n] = max(tree[n * 2], tree[n * 2 + 1]);
}

void build(int n, int start, int end) {
    if (start == end) {
        tree[n] = v[end];
        return;
    }

    int mid = (start + end) / 2;
    build(n * 2, start, mid);
    build(n * 2 + 1, mid + 1, end);
    tree[n] = max(tree[n * 2], tree[n * 2 + 1]);
}

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