#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 100000;

int n, m;
int A[MAXN + 5];
int tree[4 * MAXN + 5];

void build(int node, int start, int end) {
    if (start == end) {
        tree[node] = A[start];
    } else {
        int mid = (start + end) / 2;
        build(2 * node, start, mid);
        build(2 * node + 1, mid + 1, end);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
}

void update(int node, int start, int end, int idx, int val) {
    if (start == end) {
        A[idx] = val;
        tree[node] = val;
    } else {
        int mid = (start + end) / 2;
        if (start <= idx && idx <= mid) {
            update(2 * node, start, mid, idx, val);
        } else {
            update(2 * node + 1, mid + 1, end, idx, val);
        }
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
}

int query(int node, int start, int end, int l, int r) {
    if (r < start || end < l) {
        return 0;
    }
    if (l <= start && end <= r) {
        return tree[node];
    }
    int mid = (start + end) / 2;
    int left_query = query(2 * node, start, mid, l, r);
    int right_query = query(2 * node + 1, mid + 1, end, l, r);
    return max(left_query, right_query);
}

int main() {
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");

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

    build(1, 1, n);

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

    fin.close();
    fout.close();
    return 0;
}